000 01570cam a2200457 a 4500
001 u2272
003 SA-PMU
005 20210418124943.0
008 051117s2006 enka b 001 0 eng
010 _a 2005937504
040 _aUKM
_cUKM
_dDLC
_dBAKER
_dC#P
_dOHX
_dNLGGC
_dYDXCP
_dBTCTA
_dOCLCG
_dDEBBG
015 _aGBA614844
_2bnb
015 _a05,N48,0749
_2dnb
016 7 _a013381062
_2Uk
020 _a9781846282973 (acid-free paper)
020 _a1846282977 (acid-free paper)
028 5 2 _a10949559
035 _a(OCoLC)63137198
042 _alccopycat
050 0 0 _aQA267.7
_b.K69 2006
082 0 4 _a511.352
_222
084 _a54.10
_2bcl
084 _a500
_2sdnb
084 _aST 134
_2rvk
100 1 _aKozen, Dexter,
_d1951-
245 1 0 _aTheory of computation /
_cDexter C. Kozen.
260 _aLondon :
_bSpringer,
_cc2006.
300 _axiii, 418 p. :
_bill. ;
_c25 cm.
490 1 _aTexts in computer science
504 _aIncludes bibliographical references (p. [391]-398) and index.
650 0 _aComputational complexity.
650 0 _aComputer science
_xMathematics.
650 0 _aRecursion theory.
830 0 _aTexts in computer science.
856 4 2 _3Publisher description
_uhttp://catdir.loc.gov/catdir/enhancements/fy0663/2005937504-d.html
856 4 1 _3Table of contents only
_uhttp://catdir.loc.gov/catdir/enhancements/fy0818/2005937504-t.html
856 4 2 _qtext/html
_uhttp://deposit.ddb.de/cgi-bin/dokserv?id=2705393&prov=M&dok_var=1&dok_ext=htm
_3Inhaltstext
942 _cBOOK
994 _aZ0
_bSUPMU
596 _a1 2
999 _c10572
_d10572