Učitavanje...
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...
| Glavni autor: | |
|---|---|
| Format: | Printed Book |
| Jezik: | English |
| Izdano: |
New York :
Cambridge University Press,
2010.
|
| Teme: | |
| Online pristup: | Cover image |
| LEADER | 02836cam a2200409ua 4500 | ||
|---|---|---|---|
| 001 | 16271898 | ||
| 005 | 20191212161748.0 | ||
| 008 | 120703s2010 nyua b 001 0 eng | ||
| 010 | |a 2010023587 | ||
| 020 | |a 0521122546 (pbk.) | ||
| 020 | |a 052119248X (hardback) | ||
| 020 | |a 9780521122542 (pbk.) | ||
| 020 | |a 9780521192484 (hardback) | ||
| 035 | |a (OCoLC)ocn642204747 | ||
| 040 | |a DLC |c DLC |d YDX |d CDX |d YDXCP |d DLC | ||
| 042 | |a pcc | ||
| 050 | 0 | 0 | |a QA267.7 |b .G652 2010 |
| 082 | |2 22 |a 005.1 | ||
| 100 | |a Goldreich, Oded. | ||
| 245 | |a P, NP, and NP-completeness : |b the basics of computational complexity / |c Oded Goldreich. |h Textual Documents | ||
| 260 | |a New York : |b Cambridge University Press, |c 2010. | ||
| 300 | |a xxix, 184 p. : |b ill. ; |c 24 cm. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | |a 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. | ||
| 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"--Provided by publisher. | ||
| 650 | |a Computational complexity. | ||
| 650 | 0 | |a Approximation theory. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Polynomials. | |
| 852 | |t 1 |p DCS03952 |k 511.3 |c R |m GOL | ||
| 856 | 4 | 2 | |3 Cover image |u http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg |
| 906 | |a 7 |b cbc |c orignew |d 1 |e ecip |f 20 |g y-gencatlg | ||
| 925 | 0 | |a acquire |b 2 shelf copies |x policy default | |
| 942 | |c BK | ||
| 955 | |a xe09 2010-11-24 2 copies rec`d., to CIP ver. |b xj12 2010-06-08 |c xj12 2010-06-08 ONIX (telework) to STM |d xh09 2010-06-15 to Dewey |f rc09 2010-11-29 Z-CipVer |t rc09 2010-11-29 c. 2 added |w rd14 2010-06-15 | ||
| 999 | |c 240313 |d 240313 | ||
| 952 | |0 0 |1 0 |4 0 |6 511_300000000000000 |7 0 |9 254907 |a DCS |b DCS |c R |d 2019-12-12 |l 0 |m 0 |o 511.3 |p DCS03952 |r 2019-12-12 |t 1 |w 2019-12-12 |y BK | ||