On computational complexity of Riemann mapping
<|reference_start|>On computational complexity of Riemann mapping: In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of pixels, or by a Turing Machine.<|reference_end|>
@article{binder2005on,
    title={On computational complexity of Riemann mapping},
    author={Ilia Binder, Mark Braverman, Michael Yampolsky},
    journal={arXiv preprint arXiv:math/0505617},
    year={2005},
    archivePrefix={arXiv},
    eprint={math/0505617},
    primaryClass={math.CV cs.CC}
}