MARC Record from harvard_bibliographic_metadata

LEADER: 01578cam a2200301 a 4500
001 011798924-X
005 20130327194442.0
008 080212s2008 enka b 001 0 eng
010 $a 2008006750
015 $aGBA859156$2bnb
016 7 $a014595899$2Uk
020 $a9780521884730 (hardback)
020 $a052188473X (hardback)
035 0 $aocn192050142
040 $aDLC$cDLC$dBAKER$dBTCTA$dYDXCP$dUKM$dC#P$dBWX$dIXA$dBWK$dGZT$dOUP
050 00 $aQA267.7$b.G65 2008
082 00 $a511.3/52$222
100 1 $aGoldreich, Oded.
245 10 $aComputational complexity :$ba conceptual perspective /$cOded Goldreich.
260 $aCambridge ;$aNew York :$bCambridge University Press,$c2008.
300 $axxiv, 606 p. :$bill. ;$c27 cm.
504 $aIncludes bibliographical references (p. 589-599) and index.
505 0 $aIntroduction and preliminaries -- P, NP and NP-completeness -- Variations on P and NP -- More resources, more power -- Space complexity -- Randomness and counting -- The bright side of hardness -- Pseudorandom generators -- Probabilistic proof systems -- Relaxing the requirements -- Appendix A: Glossary of complexity classes -- Appendix B: On the quest for lower bounds -- Appendix C: On the foundations of modern cryptography -- Appendix D: Probabilistic preliminaries and advanced topics in randomization -- Appendix E: Explicit constructions -- Appendix F: Some omitted proofs -- Appendix G: Some computational problems.
650 0 $aComputational complexity.
650 0 $aTuring machines.
988 $a20090107
049 $aMCSS
906 $0DLC