Pages that link to "Item:Q1785010"
From MaRDI portal
The following pages link to Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010):
Displaying 6 items.
- On computational complexity of Siegel Julia sets (Q984472) (← links)
- Computability of topological entropy: from general systems to transformations on Cantor sets and the interval (Q2176543) (← links)
- Real quadratic Julia sets can have arbitrarily high complexity (Q2658550) (← links)
- Poly-time computability of the Feigenbaum Julia set (Q2976303) (← links)
- Towards understanding the theoretical challenges of numerical modeling of dynamical systems (Q3380363) (← links)
- Computable Geometric Complex Analysis and Complex Dynamics (Q5024571) (← links)