Books written by Stephen A. Cook.

Turing Award winner of 1982 for his advancement of our understanding of the complexity of computation in a significant and profound way.

Logical Foundations of Proof Complexity

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity.