000 01222nam a22003855i 4500
001 978-0-387-26806-4
003 DE-He213
005 20130515020414.0
007 cr nn 008mamaa
008 100301s2005 xxu| s |||| 0|eng d
020 _a9780387268064
_9978-0-387-26806-4
024 7 _a10.1007/b138114
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aBurgin, Mark.
245 1 0 _aSuper-Recursive Algorithms
_h[electronic resource] /
_cby Mark Burgin.
260 _aNew York, NY :
_bSpringer New York,
_c2005.
300 _bdigital.
490 0 _aMonographs in Computer Science,
_x0172-603X
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aTheory of Computation.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387955698
830 0 _aMonographs in Computer Science,
_x0172-603X
856 4 0 _uhttp://dx.doi.org/10.1007/b138114
912 _aZDB-2-SCS
999 _c66118
_d66118