The polynomial topological complexity of Fatou-Julia sets
From MaRDI portal
Publication:1899297
DOI10.1007/BF02432003zbMath0833.68051OpenAlexW2005145678WikidataQ123019765 ScholiaQ123019765MaRDI QIDQ1899297
Publication date: 9 October 1995
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02432003
Related Items (1)
Cites Work
- Quasiconformal homeomorphisms and dynamics. I: Solution of the Fatou- Julia problem on wandering domains
- On the topology of algorithms. I
- A problem of Julia sets
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The polynomial topological complexity of Fatou-Julia sets