Author:
Rojas Cristobal,Yampolsky Michael
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis
Reference13 articles.
1. I. Binder, M. Braverman, and M. Yampolsky, On computational complexity of Siegel Julia sets, Commun. Math. Phys. 264 (2006), no. 2, 317–334.
2. M. Braverman, Computational complexity of Euclidean sets: Hyperbolic Julia sets are poly-time computable, Master’s thesis, University of Toronto, 2004.
3. M. Braverman, Parabolic Julia sets are polynomial time computable, Nonlinearity 19(2006), no. (6), 1383–1401.
4. M Braverman and M. Yampolsky, Computability of Julia sets, Algorithms and Computation in Mathematics, vol. 23, Springer, 2008.
5. A. Douady, Does a Julia set depend continuously on the polynomial?, Complex dynamical systems (Cincinnati, OH, 1994), Proc. Sympos. Appl. Math., vol. 49, Amer. Math. Soc., Providence, RI, 1994, pp. 91–138.