Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007651076/catalog> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- catalog contributor b10575630.
- catalog created "1995, c1994.".
- catalog date "1995".
- catalog date "1995, c1994.".
- catalog dateCopyrighted "1995, c1994.".
- catalog description "Includes bibliographical references and indexes.".
- catalog description "pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond.".
- catalog extent "xv, 523 p. :".
- catalog hasFormat "Computational complexity.".
- catalog identifier "0201530821".
- catalog isFormatOf "Computational complexity.".
- catalog issued "1995".
- catalog issued "1995, c1994.".
- catalog language "eng".
- catalog publisher "Reading, Mass. : Addison-Wesley,".
- catalog relation "Computational complexity.".
- catalog subject "511.3 20".
- catalog subject "Computational complexity.".
- catalog subject "QA267.7 .P36 1994".
- catalog tableOfContents "pt. I. Algorithms. 1. Problems and Algorithms. 2. Turing machines. 3. Computability -- pt. II. Logic. 4. Boolean logic. 5. First-order logic. 6. Undecidability in logic -- pt. III. P and NP. 7. Relations between complexity classes. 8. Reductions and completeness. 9. NP-complete problems. 10. coNP and function problems. 11. Randomized computation. 12. Cryptography. 13. Approximability. 14. On P vs. NP -- pt. IV. Inside P. 15. Parallel computation. 16. Logarithmic space -- pt. V. Beyond NP. 17. The polynomial hierarchy. 18. Computation that counts. 19. Polynomial space. 20. A glimpse beyond.".
- catalog title "Computational complexity / Christos H. Papadimitriou.".
- catalog type "text".