Open Access
October 2007 On the computational complexity of the Riemann mapping
Ilia Binder, Mark Braverman, Michael Yampolsky
Author Affiliations +
Ark. Mat. 45(2): 221-239 (October 2007). DOI: 10.1007/s11512-007-0045-x


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.


Download Citation

Ilia Binder. Mark Braverman. Michael Yampolsky. "On the computational complexity of the Riemann mapping." Ark. Mat. 45 (2) 221 - 239, October 2007.


Received: 9 September 2005; Revised: 5 February 2007; Published: October 2007
First available in Project Euclid: 31 January 2017

zbMATH: 1153.30005
MathSciNet: MR2342601
Digital Object Identifier: 10.1007/s11512-007-0045-x

Rights: 2007 © Institut Mittag-Leffler

Vol.45 • No. 2 • October 2007
Back to Top