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.
Original language | English (US) |
---|---|
Pages (from-to) | 221-239 |
Number of pages | 19 |
Journal | Arkiv for Matematik |
Volume | 45 |
Issue number | 2 |
DOIs | |
State | Published - Oct 2007 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Mathematics(all)