Overview

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.

Full Product Details

9781009611701

Table of Contents

Reviews

Author Information

Jan Krajíček is Professor of Mathematical Logic at Charles University, Prague. A member of the Learned Society of the Czech Republic and the Academia Europaea, he has previously published three books with Cambridge University Press (1995, 2011 and 2019).

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available