4 citations · 12 across the 15 of their papers we have counts for
Showing 2005Show all
3 papers · 1 filter
math.CV2005
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 th…
math.DS2005
The rigidity problem for analytic critical circle maps
D. Khmelev, M. Yampolsky
It is shown that if and are any two analytic critical circle mappings with the same irrational rotation number, then the conjugacy that maps the critical point of to th…
math.DS2005
On computational complexity of Siegel Julia sets
I. Binder, M. Braverman, M. Yampolsky
It has been previously shown by two of the authors that some polynomial Julia sets are algorithmically impossible to draw with arbitrary magnification. On the other hand, for a lar…