| Record ID | ia:theoryofcomputat0000koze |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/theoryofcomputat0000koze/theoryofcomputat0000koze_marc.xml |
| Download MARC binary | https://www.archive.org/download/theoryofcomputat0000koze/theoryofcomputat0000koze_meta.mrc |
LEADER: 01176cam a2200337 a 4500
001 2005937504
003 DLC
005 20080311092246.0
008 051117s2006 enka b 001 0 eng
010 $a 2005937504
015 $aGBA614844
016 7 $a013381062$2Uk
020 $a9781846282973 (acid-free paper)
020 $a1846282977 (acid-free paper)
035 $a(CStRLIN)NYUGB13307285-B
035 $a(OCoLC)ocm63137198
040 $aUKM$cUKM$dBAKER$dC#P$dOHX$dDLC
042 $alccopycat
050 00 $aQA267.7$b.K69 2006
082 04 $a511.352$222
100 1 $aKozen, Dexter,$d1951-
245 10 $aTheory of computation /$cDexter C. Kozen.
260 $aLondon :$bSpringer,$cc2006.
300 $axiii, 418 p. :$bill. ;$c25 cm.
440 0 $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.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0663/2005937504-d.html
856 41 $3Table of contents only$uhttp://www.loc.gov/catdir/enhancements/fy0818/2005937504-t.html