|
|
|
|
| LEADER |
01082nam a2200265 a 4500 |
| 001 |
558868 |
| 005 |
20171111230023.0 |
| 008 |
100608s2010 nyua b 001 0 eng |
| 020 |
|
|
|a 9780521192484 (hardback)
|
| 020 |
|
|
|a 052119248X (hardback)
|
| 020 |
|
|
|a 9780521122542 (pbk.)
|
| 040 |
|
|
|a DLC
|
| 050 |
|
|
|a QA267.7
|b .G652 2010
|
| 082 |
|
|
|2 22
|a 005.1
|
| 100 |
1 |
|
|a Goldreich, Oded
|
| 245 |
1 |
|
|a P, NP, and NP-completeness :
|b the basics of computational complexity /
|c Oded Goldreich.
|
| 260 |
1 |
|
|a New York :
|b Cambridge University Press,
|c 2010.
|
| 300 |
1 |
|
|a xxix, 184 p. :
|b ill. ;
|c 24 cm.
|
| 504 |
1 |
|
|a Includes bibliographical references and index.
|
| 505 |
1 |
|
|a Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory.
|
| 650 |
1 |
|
|a Computational complexity
|
| 650 |
1 |
|
|a Computer algorithms
|
| 650 |
1 |
|
|a Approximation theory
|
| 650 |
1 |
|
|a Polynomials
|
| 952 |
|
|
|a GrThPMO
|b 59b01b246c5ad17d7e5aefe4
|c 952a
|d 9528
|e QA267.7.G652 2010
|t 7
|x m
|z Books
|
