On computational complexity of Riemann mapping

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Complex Variables, Computational Complexity, 30C35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/123208

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0505617
 http://arxiv.org/abs/math/0505617

Collections

arXiv