Matches in Library of Congress for { <http://lccn.loc.gov/2011941200> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- 2011941200 contributor B12423996.
- 2011941200 contributor B12423997.
- 2011941200 created "c2011.".
- 2011941200 date "2011".
- 2011941200 date "c2011.".
- 2011941200 dateCopyrighted "c2011.".
- 2011941200 description "1. Preliminaries -- 2. Introduction to computability -- 3. Undecidability -- 4. Introduction to complexity theory -- 5. Basic results of complexity theory -- 6. Nondeterminism and NP-completeness -- 7. Relative computability -- 8. Nonuniform complexity -- 9. Parallelism -- 10. Probabilistic complexity classes -- 11. Introduction to counting classes -- 12. Interactive proof systems.".
- 2011941200 description "Includes bibliographical references (p. 283-288) and index.".
- 2011941200 extent "xvi, 298 p. :".
- 2011941200 identifier "1461406811 (hbk.)".
- 2011941200 identifier "9781461406815 (hbk.)".
- 2011941200 identifier "9781461406822 (e-ISBN)".
- 2011941200 isPartOf "Texts in computer science".
- 2011941200 isPartOf "Texts in computer science.".
- 2011941200 issued "2011".
- 2011941200 issued "c2011.".
- 2011941200 language "eng".
- 2011941200 publisher "New York ; London : Springer,".
- 2011941200 subject "004 23".
- 2011941200 subject "Computable functions.".
- 2011941200 subject "Computational complexity.".
- 2011941200 subject "Computer science.".
- 2011941200 subject "QA76 .H6236 2011".
- 2011941200 tableOfContents "1. Preliminaries -- 2. Introduction to computability -- 3. Undecidability -- 4. Introduction to complexity theory -- 5. Basic results of complexity theory -- 6. Nondeterminism and NP-completeness -- 7. Relative computability -- 8. Nonuniform complexity -- 9. Parallelism -- 10. Probabilistic complexity classes -- 11. Introduction to counting classes -- 12. Interactive proof systems.".
- 2011941200 title "Computability and complexity theory / Steven Homer, Alan L. Selman.".
- 2011941200 type "text".