On the computational complexity of the Riemann mapping |
| |
| Authors: | Ilia Binder Mark Braverman Michael Yampolsky |
| |
| Affiliation: | (1) Department of Mathematics, University of Toronto, 40 St. George St., Toronto, Ontario, M5S 2E4, Canada;(2) Department of Computer Science, University of Toronto, 10 King’s College Road, Toronto, Ontario, M5S 3G4, Canada |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
