A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
On the computational complexity of the Riemann mapping
On the computational complexity of the Riemann mapping
On the computational complexity of the Riemann mapping
Binder, I. (author) / Braverman, M. (author) / Yampolsky, M. (author)
ARKIV FOR MATEMATIK ; 45 ; 221-239
2007-01-01
19 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
A Riemann Mapping Theorem for Two-Connected Domains in the Plane
| British Library Online Contents | 2009
British Library Online Contents | 1999
Online Contents | 1999