Cargando…
P, NP, and NP-completeness : the basics of computational complexity /
"The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of sol...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2010.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ia 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn672333517 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr mnu---unuuu | ||
| 008 | 101028s2010 enka ob 001 0 eng d | ||
| 010 | |z 2010023587 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OSU |d CDX |d E7B |d OCLCQ |d REDDC |d OCLCQ |d DEBSZ |d OCLCQ |d CAMBR |d OCLCF |d OCLCQ |d COD |d OCLCQ |d IDEBK |d PIFAR |d VGM |d OCLCQ |d WY@ |d LUE |d UAB |d OCLCQ |d TKN |d OCLCQ |d K6U |d LUN |d CUY |d UKAHL |d QGK |d OCLCO |d OCLCQ |d INARC | ||
| 019 | |a 671531020 |a 729025938 |a 816592434 |a 817916197 |a 819629682 |a 1170826001 |a 1171013872 |a 1259216847 |a 1392328185 | ||
| 020 | |a 9780511909443 |q (electronic bk.) | ||
| 020 | |a 0511909446 |q (electronic bk.) | ||
| 020 | |a 9780511906657 |q (ebook) | ||
| 020 | |a 051190665X |q (ebook) | ||
| 020 | |a 1282797662 | ||
| 020 | |a 9781282797666 | ||
| 020 | |z 9780521192484 |q (hardback) | ||
| 020 | |z 052119248X |q (hardback) | ||
| 020 | |z 9780521122542 |q (pbk.) | ||
| 020 | |z 0521122546 |q (pbk.) | ||
| 020 | |a 9780511761355 |q (ebook) | ||
| 020 | |a 051176135X | ||
| 020 | |a 1139929771 | ||
| 020 | |a 9781139929776 | ||
| 020 | |a 9786612797668 | ||
| 020 | |a 6612797665 | ||
| 020 | |a 0511908687 | ||
| 020 | |a 9780511908682 | ||
| 020 | |a 0511905378 | ||
| 020 | |a 9780511905377 | ||
| 020 | |a 0511907931 | ||
| 020 | |a 9780511907937 | ||
| 024 | 8 | |a 9786612797668 | |
| 029 | 1 | |a AU@ |b 000062584241 | |
| 029 | 1 | |a DEBSZ |b 372801927 | |
| 029 | 1 | |a AU@ |b 000064838297 | |
| 035 | |a (OCoLC)672333517 |z (OCoLC)671531020 |z (OCoLC)729025938 |z (OCoLC)816592434 |z (OCoLC)817916197 |z (OCoLC)819629682 |z (OCoLC)1170826001 |z (OCoLC)1171013872 |z (OCoLC)1259216847 |z (OCoLC)1392328185 | ||
| 037 | |a 279766 |b MIL | ||
| 050 | 4 | |a QA267.7 |b .G652 2010eb | |
| 072 | 7 | |a COM |x 051390 |2 bisacsh | |
| 072 | 7 | |a COM |x 051440 |2 bisacsh | |
| 072 | 7 | |a COM |x 051230 |2 bisacsh | |
| 072 | 7 | |a UMB |2 bicssc | |
| 082 | 0 | 4 | |a 005.1 |2 22 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Goldreich, Oded. | |
| 245 | 1 | 0 | |a P, NP, and NP-completeness : |b the basics of computational complexity / |c Oded Goldreich. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c ©2010. | ||
| 300 | |a 1 online resource (xxix, 184 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 520 | |a "The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P-versus-NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete"-- |c Provided by publisher. | ||
| 504 | |a Includes bibliographical references (pages 181-182) and index. | ||
| 505 | 0 | |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. | |
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Approximation theory. | |
| 650 | 0 | |a Polynomials. | |
| 650 | 2 | |a Algorithms | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 6 | |a Théorie de l'approximation. | |
| 650 | 6 | |a Polynômes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Programming |x Open Source. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Software Development & Engineering |x Tools. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Software Development & Engineering |x General. |2 bisacsh | |
| 650 | 7 | |a Approximation theory. |2 fast |0 (OCoLC)fst00811829 | |
| 650 | 7 | |a Computational complexity. |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010 | |
| 650 | 7 | |a Polynomials. |2 fast |0 (OCoLC)fst01070715 | |
| 776 | 0 | 8 | |i Print version: |a Goldreich, Oded. |t P, NP, and NP-completeness. |d New York : Cambridge University Press, 2010 |z 9780521192484 |w (DLC) 2010023587 |w (OCoLC)642204747 |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200 |z Texto completo |
| 938 | |a Coutts Information Services |b COUT |n 15552555 | ||
| 938 | |a ebrary |b EBRY |n ebr10421563 | ||
| 938 | |a EBSCOhost |b EBSC |n 335200 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 279766 | ||
| 938 | |a YBP Library Services |b YANK |n 3525102 | ||
| 938 | |a YBP Library Services |b YANK |n 3478332 | ||
| 938 | |a YBP Library Services |b YANK |n 3500655 | ||
| 938 | |a YBP Library Services |b YANK |n 9246371 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH22947183 | ||
| 938 | |a Internet Archive |b INAR |n pnpnpcompletenes0000gold | ||
| 994 | |a 92 |b IZTAP | ||