Abstract
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 the boundary is given either as a list of pixels, or by a Turing machine.
Citation
Ilia Binder. Mark Braverman. Michael Yampolsky. "On the computational complexity of the Riemann mapping." Ark. Mat. 45 (2) 221 - 239, October 2007. https://doi.org/10.1007/s11512-007-0045-x
Information
