P, NP, and NP-Completeness by Oded Goldreich. Author Oded Goldreich. It also provides adequate preliminaries regarding computational problems and computational models. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness.
| ISBN-13 | 9780521192484 |
| ISBN | 9780521192484 |
| Subject Area | Computers |
| Item Length | 9 in |
| Subject | Machine Theory, General |
| Publication Year | 2010 |
| Type | Textbook |
| Format | Hardcover |
| Language | English |
| Item Height | 0.7 in |
| Author | Oded Goldreich |
| Item Weight | 17.3 Oz |
| Item Width | 5.8 in |
| Number Of Pages | 216 Pages |
What stands out about this textbook is the author’s clear and direct explanations.
