On computational complexity of Riemann mapping
classification
🧮 math.CV
cs.CC
keywords
boundarycomplexitycomputationalgivenapproximationboundscomputableconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.