Almost every real quadratic polynomial has a poly-time computable Julia set
classification
🧮 math.DS
keywords
juliapoly-timealmostcomputablequadraticrealsetscollet-eckmann
read the original abstract
We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.