On computational complexity of Riemann mapping
Ilia Binder, Mark Braverman, Michael Yampolsky
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 boundary is given either as a list of pixels, or by a Turing Machine.
Create a lesson
Related papers
Limit theorems for Coulomb gases on a Jordan curve in an external potential
Kurt Johansson, Thomas Wolfs
On Simply Connected Domains Supporting an Unbounded Analytic Function with Bounded Derivative
Cameron MacMahon
The Reciprocal Problem on Weighted Bergman Spaces
Guangfu Cao, Li He, Shuqing Zhang
On φ-Normality of Harmonic Mappings and Their Families
Gopal Datt, Ritesh Pal
Weak Asymptotic Symmetry of Quasisymmetric Embeddings on Quasilines
Katsuhiko Matsuzaki, Fei Tao
Target Geometry in Prescribed-Value Schwarz Lemmas for Harmonic Maps
Miljan Knežević, Miodrag Mateljević