On computational complexity of Siegel Julia sets
<|reference_start|>On computational complexity of Siegel Julia sets: It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a large class of examples the problem of drawing a picture has polynomial complexity. In this paper we demonstrate the existence of computable quadratic Julia sets whose computational complexity is arbitrarily high.<|reference_end|>
@article{binder2005on,
    title={On computational complexity of Siegel Julia sets},
    author={I. Binder, M. Braverman, M. Yampolsky},
    journal={arXiv preprint arXiv:math/0502354},
    year={2005},
    doi={10.1007/s00220-006-1546-3},
    archivePrefix={arXiv},
    eprint={math/0502354},
    primaryClass={math.DS cs.CC}
}