arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0505617math.CVcs.CC
收藏

On computational complexity of Riemann mapping

Ilia Binder, Mark Braverman, Michael Yampolsky

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑