Pages that link to "Item:Q3581268"
From MaRDI portal
The following pages link to The computational complexity of some julia sets (Q3581268):
Displayed 22 items.
- Rigorous bounds for polynomial Julia sets (Q523958) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- On the computational complexity of the Riemann mapping (Q942023) (← links)
- On computational complexity of Siegel Julia sets (Q984472) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- Definability as hypercomputational effect (Q2497876) (← links)
- Computability and Dynamical Systems (Q2908425) (← links)
- Is the Mandelbrot set computable? (Q3159399) (← links)
- Dimensions of Points in Self-similar Fractals (Q3511330) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- Complexity of Operators on Compact Sets (Q4918033) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
- Computability of topological pressure on compact shift spaces beyond finite type* (Q5089481) (← links)
- On the computability of rotation sets and their entropies (Q5207982) (← links)
- Computing the topological entropy of shifts (Q5307614) (← links)
- Computational unsolvability of domains of attraction of nonlinear systems (Q5322874) (← links)
- Non-computable Julia sets (Q5469247) (← links)
- Computing eigenvalues of the Laplacian on rough domains (Q6076240) (← links)