14 citations · 17 across the 3 of their papers we have counts for
1 paper · 1 filter
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 th…