On the computational complexity of the Riemann mapping

Ilia Binder Department of Mathematics, University of Toronto Mark Braverman Department of Computer Science, University of Toronto Michael Yampolsky Department of Mathematics, University of Toronto

TBD mathscidoc:1701.333110

Arkiv for Matematik, 45, (2), 221-239, 2005.9
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.
No keywords uploaded!
[ Download ] [ 2017-01-08 20:36:20 uploaded by arkivadmin ] [ 75 downloads ] [ 0 comments ] [ Cited by 8 ]
@inproceedings{ilia2005on,
  title={On the computational complexity of the Riemann mapping},
  author={Ilia Binder, Mark Braverman, and Michael Yampolsky},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170108203620404271919},
  booktitle={Arkiv for Matematik},
  volume={45},
  number={2},
  pages={221-239},
  year={2005},
}
Ilia Binder, Mark Braverman, and Michael Yampolsky. On the computational complexity of the Riemann mapping. 2005. Vol. 45. In Arkiv for Matematik. pp.221-239. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20170108203620404271919.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved