P, NP, and NP-Completeness

Discover the intriguing world of computational complexity with P, NP, and NP-Completeness by renowned author. Published by Cambridge University Press in 2010, this insightful paperback spans 216 pages and serves as an essential undergraduate introduction to two pivotal issues in theoretical computer science.

This comprehensive guide begins by laying the groundwork in computability, covering crucial topics such as Turing machines, search and decision problems, algorithms, circuits, and complexity classes. The book then delves into the fascinating P versus NP Question and the intricate theory of NP-completeness, offering readers a broad perspective on these fundamental concepts.

Whether you're a student, educator, or simply a curious mind, P, NP, and NP-Completeness is a must-have resource for anyone looking to deepen their understanding of computational theory.