
cambridge university press
Proof Complexity Generators
Lowest observed price
Prices at stores
1 offerPrices are the most recently observed prices. Check the current price, availability and delivery costs at the store.
Price history
2 price observationsThe chart shows the lowest recorded product price on each observation day. Prices between observations have not been verified.
- Lowest observed
- €59.10
- Highest observed
- €62.90
- Latest history observation
Show all 2 price observations
| Price observed (Finnish time) | Price |
|---|---|
| €62.90 | |
| €59.10 |
Product details
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.
- Brand
- cambridge university press
- EAN / GTIN
- 9781009611701
