Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10208-017-9367-7 | Foundations of Computational Mathematics |
Keywords | Field | DocType |
Julia set, Computational complexity, Collet–Eckmann condition, 68Q17, 37F50 | Filled Julia set,Discrete mathematics,Newton fractal,Mathematical analysis,Quadratic equation,Quadratic function,Julia set,External ray,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
18 | 5 | 1615-3375 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Artem Dudko | 1 | 0 | 0.68 |
| Michael Yampolsky | 2 | 44 | 6.02 |