Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008540714/catalog> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- catalog contributor b11947853.
- catalog contributor b11947854.
- catalog created "c2000.".
- catalog date "2000".
- catalog date "c2000.".
- catalog dateCopyrighted "c2000.".
- catalog description "1. Introduction -- 2. Morphisms in logic and complexity -- 3. Exponential processes and formal proofs -- 4. Graphs and their visibilities -- 5. Asymptotic growth of infinite visibilities -- 6. Geometric aspects of cut elimination -- 7. Feasibility graphs -- 8. Bounds for finite visibilities -- 9. Some related computational questions -- 10. Mappings and graphs -- 11. Mappings and comparisons -- 12. Adjacency matrices and counting -- 13. Duality and NP-completeness -- 14. Finite automata and regular languages -- 15. Constructions with graphs -- 16. Stronger forms of recursion -- 17. Groups and graphs -- 18. Extended notions of automata -- 19. Geometry of scales in metric spaces -- 20. The Corona decomposition revisited.".
- catalog description "Includes bibliographical references (p. [487]-495) and index.".
- catalog extent "xvii, 501 p. :".
- catalog identifier "0198507291".
- catalog isPartOf "Oxford mathematical monographs".
- catalog issued "2000".
- catalog issued "c2000.".
- catalog language "eng".
- catalog publisher "Oxford ; New York : Oxford University Press,".
- catalog subject "511.3 21".
- catalog subject "Computational complexity.".
- catalog subject "Graph theory.".
- catalog subject "Group theory.".
- catalog subject "Machine theory.".
- catalog subject "QA267.7 .C37 2000".
- catalog tableOfContents "1. Introduction -- 2. Morphisms in logic and complexity -- 3. Exponential processes and formal proofs -- 4. Graphs and their visibilities -- 5. Asymptotic growth of infinite visibilities -- 6. Geometric aspects of cut elimination -- 7. Feasibility graphs -- 8. Bounds for finite visibilities -- 9. Some related computational questions -- 10. Mappings and graphs -- 11. Mappings and comparisons -- 12. Adjacency matrices and counting -- 13. Duality and NP-completeness -- 14. Finite automata and regular languages -- 15. Constructions with graphs -- 16. Stronger forms of recursion -- 17. Groups and graphs -- 18. Extended notions of automata -- 19. Geometry of scales in metric spaces -- 20. The Corona decomposition revisited.".
- catalog title "A graphic apology for symmetry and implicitness / Alessandra Carbone and Stephen Semmes.".
- catalog type "text".