Proof Complexity Generators
Series: London Mathematical Society Lecture Note Series; 497;
- Publisher's listprice GBP 45.00
-
22 774 Ft (21 690 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 2 277 Ft off)
- Discounted price 20 497 Ft (19 521 Ft + 5% VAT)
22 774 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 31 May 2025
- ISBN 9781009611701
- Binding Paperback
- No. of pages143 pages
- Language English 700
Categories
Short description:
Discover a state-of-the-art theory aiming to construct hard propositional tautologies needed to solve the NP vs. coNP problem.
MoreLong 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.
MoreTable of Contents:
1. Introduction; 2. The dWPHP problem; 3. &&&964;-formulas and generators; 4. The stretch; 5. Nisan-Wigderson generator; 6. Gadget generator; 7. The case of ER; 8. Consistency results; 9. Contexts; 10. Further research; Special symbols; References; Index.
More
