| Record ID | marc_nuls/NULS_PHC_180925.mrc:212832485:1961 |
| Source | marc_nuls |
| Download Link | /show-records/marc_nuls/NULS_PHC_180925.mrc:212832485:1961?format=raw |
LEADER: 01961cam 2200457 a 4500
001 9919908120001661
005 20161129132003.0
008 060104s2006 maua b 001 0 eng
010 $a 2006271030
020 $a0534950973
020 $a9780534950972
029 1 $aYDXCP$b2181807
029 1 $aNZ1$b9230074
029 1 $aAU@$b000027379731
029 1 $aAU@$b000026999146
035 $a(CSdNU)u353373-01national_inst
035 $a(OCoLC)58544333
035 $a(OCoLC)58544333
035 $a(OCoLC)58544333
040 $aDLC$cDLC$dXAV$dBOS$dBAKER$dMBB$dUBA$dBTCTA$dYDXCP$dOrLoB-B
049 $aCNUM
050 00 $aQA267$b.S56 2006
082 00 $a511.3/5$222
100 1 $aSipser, Michael.
245 10 $aIntroduction to the theory of computation /$cMichael Sipser.
250 $a2nd ed.
260 $aBoston :$bThomson Course Technology,$cc2006.
300 $axix, 431 p. :$bill. ;$c25 cm.
504 $aIncludes bibliographical references (p. 415-419) and index.
505 0 $aPt. 1. Automata and Languages -- 1. Regular Languages -- 2. Context-Free Languages -- Pt. 2. Computability Theory -- 3. The Church-Turing Thesis -- 4. Decidability -- 5. Reducibility -- 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory -- 7. Time Complexity -- 8. Space Complexity -- 9. Intractability -- 10. Advanced topics in complexity theory.
650 0 $aMachine theory.
650 0 $aComputational complexity.
650 6 $aComplexite? de calcul (Informatique)
650 7 $aTeoria da computacao.$2larpcal
938 $aBaker and Taylor$bBTCP$n2006271030
938 $aYBP Library Services$bYANK$n2181807
938 $aBaker & Taylor$bBKTY$c140.95$d140.95$i0534950973$n0006088336$sactive
947 $fSOET-CIS$hCIRCSTACKS$p$128.10$q1
949 $aQA 267 .S56 2006$i31786102368971
994 $a92$bCNU
999 $aQA 267 .S56 2006$wLC$c1$i31786102368971$d10/1/2012$e9/8/2012 $lCIRCSTACKS$mNULS$n3$q3$rY$sY$tBOOK$u5/18/2009