Pages that link to "Item:Q984472"
From MaRDI portal
The following pages link to On computational complexity of Siegel Julia sets (Q984472):
Displaying 9 items.
- Computability of Brolin-Lyubich measure (Q651408) (← links)
- Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010) (← links)
- Statistical properties of dynamical systems -- Simulation and abstract computation (Q2393223) (← links)
- Computability of the Julia set. Nonrecurrent critical orbits (Q2438692) (← links)
- Real quadratic Julia sets can have arbitrarily high complexity (Q2658550) (← links)
- Poly-time computability of the Feigenbaum Julia set (Q2976303) (← links)
- Computable Geometric Complex Analysis and Complex Dynamics (Q5024571) (← links)
- Non-computable Julia sets (Q5469247) (← links)
- Probability, statistics and computation in dynamical systems (Q5740360) (← links)
