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