On computational complexity of Riemann mapping

Details On computational complexity of Riemann mapping On computational complexity of Riemann mapping

2005-05-27

arxiv.org/abs/math/0505617v2

Mathematics

Complex Variables

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On computational complexity of Riemann mapping does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On computational complexity of Riemann mapping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computational complexity of Riemann mapping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80330