Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Proof Complexity Generators
    Show more authors
    • You may already have access via personal or institutional login
  • Select format
  • Publisher:
    Cambridge University Press
    Publication date:
    May 2025
    June 2025
    ISBN:
    9781009611664
    9781009611701
    DOI:
    https://doi.org/10.1017/9781009611664
    Dimensions:
    Weight & Pages:
    Dimensions:
    (229 x 152 mm)
    Weight & Pages:
    0.21kg, 134 Pages
    • Subjects:
    Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    Series:
    London Mathematical Society Lecture Note Series (497)
You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics (general), Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    Series:
    London Mathematical Society Lecture Note Series (497)
    Information

    Book description

    The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents
    References

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.