P, NP, and NP-Completeness: The Basics of Computational Complexity

• Category: Computer
• Author: Oded Goldreich
• Pages: 214 pages
• File type: Online, PostScript (PS), and PDF files

Read and download free eBook intituled P, NP, and NP-Completeness: The Basics of Computational Complexity in format Online, PostScript (PS), and PDF files – 214 pages created by Oded Goldreich.

This undergraduate introduction to computational complexity offers a wide perspective on two central issues in theoretical computer science. The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.

Read and Download Links:

P, NP, and NP-Completeness: The Basics of Computational Complexity