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. © 2007 Institut Mittag-Leffler.
Cite
CITATION STYLE
APA
Binder, I., Braverman, M., & Yampolsky, M. (2007). On the computational complexity of the Riemann mapping. Arkiv for Matematik, 45(2), 221–239. https://doi.org/10.1007/s11512-007-0045-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free