On computational complexity of Riemann mapping

Simple item page
dc.creatorBinder, Ilia
dc.creatorBraverman, Mark
dc.creatorYampolsky, Michael
dc.date2005-05-27
dc.date2007-02-05
dc.date.accessioned2026-07-07T07:44:28Z
dc.date.available2026-07-07T07:44:28Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0505617
dc.identifierhttp://arxiv.org/abs/math/0505617
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123208
dc.subjectComplex Variables
dc.subjectComputational Complexity
dc.subject30C35
dc.titleOn computational complexity of Riemann mapping
dc.typetext

Files

Collections

arXiv