On the computational complexity of the Riemann mapping

Ilia Binder, Mark Braverman, Michael Yampolsky

Research output: Contribution to journalArticle

19 Scopus citations

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 languageEnglish (US)
Pages (from-to)221-239
Number of pages19
JournalArkiv for Matematik
Volume45
Issue number2
DOIs
StatePublished - Oct 1 2007
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'On the computational complexity of the Riemann mapping'. Together they form a unique fingerprint.

  • Cite this