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
A property of boundary extensions of atomic singular inner functions
Iason Efraimidis, Adrian Llinares, Sullivan MacDonald et al.
Entire solutions of a special binomial differential equation
Dong-hai Zhao, Jie Zhang, Liang-wen Liao
Holomorphic flexibility properties of strongly commuting varieties
Stefano Giannini
A convolution inequality and the Krzyż conjecture
Sullivan Francis MacDonald
Quasiconformal distortion of the lower dimension and applications
Efstathios Konstantinos Chrontsios Garitsis, Jeremy T. Tyson
Regularity of geodesics in the spaces of convex and plurisubharmonic functions III
Soufian Abja, Slawomir Dinew