On computational complexity of Riemann mapping
复变函数
2007-05-23 v2 计算复杂性
摘要
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.
引用
@article{arxiv.math/0505617,
title = {On computational complexity of Riemann mapping},
author = {Ilia Binder and Mark Braverman and Michael Yampolsky},
journal= {arXiv preprint arXiv:math/0505617},
year = {2007}
}