Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007963613/catalog> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- catalog contributor b11042225.
- catalog created "c1999.".
- catalog date "1999".
- catalog date "c1999.".
- catalog dateCopyrighted "c1999.".
- catalog description "1. Background in Logic -- 2. Background in Complexity -- 3. First-Order Reductions -- 4. Inductive Definitions -- 5. Parallelism -- 6. Ehrenfeucht-Fraisse Games -- 7. Second-Order Logic and Fagin's Theorem -- 8. Second-Order Lower Bounds -- 9. Complementation and Transitive Closure -- 10. Polynomial Space -- 11. Uniformity and Precomputation -- 12. The Role of Ordering -- 13. Lower Bounds -- 14. Applications -- 15. Conclusions and Future Directions.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "xvi, 268 p. :".
- catalog identifier "0387986006 (hc. : alk. paper)".
- catalog isPartOf "Graduate texts in computer science (Springer-Verlag New York Inc.)".
- catalog isPartOf "Graduate texts in computer science".
- catalog issued "1999".
- catalog issued "c1999.".
- catalog language "eng".
- catalog publisher "New York : Springer,".
- catalog subject "511.3 21".
- catalog subject "Computational complexity.".
- catalog subject "Logic, Symbolic and mathematical.".
- catalog subject "QA267.7 .I46 1998".
- catalog tableOfContents "1. Background in Logic -- 2. Background in Complexity -- 3. First-Order Reductions -- 4. Inductive Definitions -- 5. Parallelism -- 6. Ehrenfeucht-Fraisse Games -- 7. Second-Order Logic and Fagin's Theorem -- 8. Second-Order Lower Bounds -- 9. Complementation and Transitive Closure -- 10. Polynomial Space -- 11. Uniformity and Precomputation -- 12. The Role of Ordering -- 13. Lower Bounds -- 14. Applications -- 15. Conclusions and Future Directions.".
- catalog title "Descriptive complexity / Neil Immerman.".
- catalog type "text".