P, NP, and NP-Completeness: The Basics of Computational Complexity
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | P, NP, and NP-Completeness: The Basics of Computational Complexity |
|---|---|
| Author / Organization | Oded Goldreich |
| Subject & Discipline | Computational Complexity, Algorithms and Data Structures, Computational and Algorithmic Mathematics, Parallel Computing and Programming |
| Categories | Computational Complexity |
| Publication Year | 2010 |
| ISBN | 0521122546 |
| Resource Verification | Verification pending |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-76520 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
P, NP, and NP-Completeness: The Basics of Computational Complexity • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.