Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic conce

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the

The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations a

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.