On the computational complexity of the Riemann mapping. Binder, I., Braverman, M., & Yampolsky, M. Ark. Mat., 45(2):221–239, 2007.
Paper doi bibtex @ARTICLE{BBY07a,
author = {Binder, Ilia and Braverman, Mark and Yampolsky, Michael},
title = {On the computational complexity of the {R}iemann mapping},
journal = {Ark. Mat.},
year = {2007},
volume = {45},
pages = {221--239},
number = {2},
coden = {AKMTAJ},
doi = {10.1007/s11512-007-0045-x},
file = {BBY07a.pdf:BBY07a.pdf:PDF},
fjournal = {Arkiv f\"or Matematik},
issn = {0004-2080},
keywords = {bib,cca},
mrclass = {03D78 (03D15 30C30 30F10 68Q17)},
mrnumber = {2342601 (2010b:03055)},
mrreviewer = {Timothy H. McNicholl},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s11512-007-0045-x}
}
Downloads: 0
{"_id":"bEHx4jqK5ZNNrNqA3","bibbaseid":"binder-braverman-yampolsky-onthecomputationalcomplexityoftheriemannmapping-2007","authorIDs":[],"author_short":["Binder, I.","Braverman, M.","Yampolsky, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Binder"],"firstnames":["Ilia"],"suffixes":[]},{"propositions":[],"lastnames":["Braverman"],"firstnames":["Mark"],"suffixes":[]},{"propositions":[],"lastnames":["Yampolsky"],"firstnames":["Michael"],"suffixes":[]}],"title":"On the computational complexity of the Riemann mapping","journal":"Ark. Mat.","year":"2007","volume":"45","pages":"221–239","number":"2","coden":"AKMTAJ","doi":"10.1007/s11512-007-0045-x","file":"BBY07a.pdf:BBY07a.pdf:PDF","fjournal":"Arkiv för Matematik","issn":"0004-2080","keywords":"bib,cca","mrclass":"03D78 (03D15 30C30 30F10 68Q17)","mrnumber":"2342601 (2010b:03055)","mrreviewer":"Timothy H. McNicholl","owner":"Vasco","timestamp":"2013.12.01","url":"http://dx.doi.org/10.1007/s11512-007-0045-x","bibtex":"@ARTICLE{BBY07a,\r\n author = {Binder, Ilia and Braverman, Mark and Yampolsky, Michael},\r\n title = {On the computational complexity of the {R}iemann mapping},\r\n journal = {Ark. Mat.},\r\n year = {2007},\r\n volume = {45},\r\n pages = {221--239},\r\n number = {2},\r\n coden = {AKMTAJ},\r\n doi = {10.1007/s11512-007-0045-x},\r\n file = {BBY07a.pdf:BBY07a.pdf:PDF},\r\n fjournal = {Arkiv f\\\"or Matematik},\r\n issn = {0004-2080},\r\n keywords = {bib,cca},\r\n mrclass = {03D78 (03D15 30C30 30F10 68Q17)},\r\n mrnumber = {2342601 (2010b:03055)},\r\n mrreviewer = {Timothy H. McNicholl},\r\n owner = {Vasco},\r\n timestamp = {2013.12.01},\r\n url = {http://dx.doi.org/10.1007/s11512-007-0045-x}\r\n}\r\n\r\n","author_short":["Binder, I.","Braverman, M.","Yampolsky, M."],"key":"BBY07a","id":"BBY07a","bibbaseid":"binder-braverman-yampolsky-onthecomputationalcomplexityoftheriemannmapping-2007","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s11512-007-0045-x"},"keyword":["bib","cca"],"downloads":0},"bibtype":"article","biburl":"http://cca-net.de/publications/lit.bib","creationDate":"2019-09-10T10:17:53.321Z","downloads":0,"keywords":["bib","cca"],"search_terms":["computational","complexity","riemann","mapping","binder","braverman","yampolsky"],"title":"On the computational complexity of the Riemann mapping","year":2007,"dataSources":["t7rKiAbxugj4Agz8M"]}