Proof Complexity Generators - Krají&
-20% with code BOOKS
Shipping in 22-28 days
30-day return policy
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 pro ... Full description
You May Also Like
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-20% with code BOOKS
In stock at our supplier
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-20% with code BOOKS
In stock at our supplier
TOP
A Short History of Nearly Everything 2.0
-20% with code BOOKS
In stock at our supplier
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
A Brief History of Time: From the Big Bang to Black Holes
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-20% with code BOOKS
In stock at our supplier
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.
More Information
| Author | Krají& |
|---|---|
| Publisher | Cambridge University Press |
| Release year | 2025 |
| Cover type | Softcover |
| EAN | 9781009611701 |