Pages that link to "Item:Q2658550"
From MaRDI portal
The following pages link to Real quadratic Julia sets can have arbitrarily high complexity (Q2658550):
Displaying 5 items.
- On computational complexity of Siegel Julia sets (Q984472) (← links)
- Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010) (← links)
- Computable Geometric Complex Analysis and Complex Dynamics (Q5024571) (← links)
- On computational complexity of Cremer Julia sets (Q5146441) (← links)
- Real quadratic Julia sets can have arbitrarily high complexity (Q6317104) (← links)