Matches in Library of Congress for { <http://lccn.loc.gov/2010023587> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- 2010023587 contributor B11764889.
- 2010023587 created "2010.".
- 2010023587 date "2010".
- 2010023587 date "2010.".
- 2010023587 dateCopyrighted "2010.".
- 2010023587 description "Includes bibliographical references and index.".
- 2010023587 description "Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.".
- 2010023587 extent "xxix, 184 p. :".
- 2010023587 identifier "0521122546 (pbk.)".
- 2010023587 identifier "052119248X (hardback)".
- 2010023587 identifier "9780521122542 (pbk.)".
- 2010023587 identifier "9780521192484 (hardback)".
- 2010023587 identifier 9780521192484.jpg.
- 2010023587 issued "2010".
- 2010023587 issued "2010.".
- 2010023587 language "eng".
- 2010023587 publisher "New York : Cambridge University Press,".
- 2010023587 subject "005.1 22".
- 2010023587 subject "Approximation theory.".
- 2010023587 subject "Computational complexity.".
- 2010023587 subject "Computer algorithms.".
- 2010023587 subject "Polynomials.".
- 2010023587 subject "QA267.7 .G652 2010".
- 2010023587 tableOfContents "Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.".
- 2010023587 title "P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.".
- 2010023587 type "text".
