000 01536nam a22004695i 4500
001 978-3-540-68547-0
003 DE-He213
005 20130515021541.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783540685470
_9978-3-540-68547-0
024 7 _a10.1007/978-3-540-68547-0
_2doi
050 4 _aQA76.9.A43
072 7 _aPBKS
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a518.1
_223
100 1 _aBraverman, Mark.
245 1 0 _aComputability of Julia Sets
_h[electronic resource] /
_cby Mark Braverman, Michael Yampolsky.
260 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _bdigital.
490 0 _aAlgorithms and Computation in Mathematics,
_x1431-1550 ;
_v23
650 0 _aMathematics.
650 0 _aInformation theory.
650 0 _aComputer software.
650 0 _aComputer science.
650 0 _aAlgebra.
650 0 _aAlgorithms.
650 1 4 _aMathematics.
650 2 4 _aAlgorithms.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aMathematics of Computing.
650 2 4 _aAlgebra.
700 1 _aYampolsky, Michael.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540685463
830 0 _aAlgorithms and Computation in Mathematics,
_x1431-1550 ;
_v23
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-68547-0
912 _aZDB-2-SMA
999 _c78418
_d78418