On computational complexity of Riemann mapping
Ilia A. Binder, Mark Braverman, Michael Yampolsky · arXiv (Cornell University) · 2005
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.