| 000 | 02604cam a2200421 i 4500 | ||
|---|---|---|---|
| 001 | u8947 | ||
| 003 | SA-PMU | ||
| 005 | 20210418123209.0 | ||
| 008 | 780814s1979 caua b 001 0 eng | ||
| 010 | _a 78012361 | ||
| 040 |
_aDLC _beng _cDLC _dOCL _dMUQ _dOCLCQ _dNLGGC _dBAKER _dBTCTA _dYDXCP _dUBA _dOCLCG _dHEBIS _dDEBBG _dESLEO _dOG# _dBDX _dOCLCO _dDEBSZ _dGBVCP _dOCLCF _dBEDGE _dNJI |
||
| 020 | _a0716710447 | ||
| 020 | _a9780716710448 | ||
| 020 | _a0716710455 (pbk.) | ||
| 020 | _a9780716710455 (pbk.) | ||
| 035 |
_a(OCoLC)4195125 _z(OCoLC)9382749 _z(OCoLC)11272890 |
||
| 050 | 0 | 0 |
_aQA76.6 _b.G35 1979 |
| 082 | 0 | 0 | _a519.4 |
| 100 | 1 | _aGarey, Michael R. | |
| 245 | 1 | 0 |
_aComputers and intractability : _ba guide to the theory of NP-completeness / _cMichael R. Garey, David S. Johnson. |
| 260 |
_aSan Francisco : _bW.H. Freeman, _cc1979. |
||
| 300 |
_ax, 338 p. : _bill. ; _c24 cm. |
||
| 490 | 1 | _aSeries of books in the mathematical sciences. | |
| 504 | _aIncludes bibliographical references (p. [291]-325). | ||
| 500 | _aIncludes indexes. | ||
| 505 | 0 | _a1. Computers, complexity, and intractability -- 2. The theory of NP-completeness -- 3. Proving NP-completeness results -- 4. Using NP-completeness to analyze problems -- 5. NP-hardness -- 6. Coping with NP-complete problems -- 7. Beyond NP-completeness -- Appendix: A list of NP-complete problems. | |
| 520 | _a"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover. | ||
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aComputer algorithms. | |
| 650 | 0 | _aComputational complexity. | |
| 700 | 1 |
_aJohnson, David S., _d1945- _ejoint author. |
|
| 740 | 0 | 1 | _aNP-completeness. |
| 776 | 0 | 8 |
_iOnline version: _aGarey, Michael R. _tComputers and intractability. _dSan Francisco : W.H. Freeman, c1979 _w(OCoLC)716418546 |
| 830 | 0 | _aSeries of books in the mathematical sciences. | |
| 942 | _cBOOK | ||
| 994 |
_aZ0 _bSUPMU |
||
| 596 | _a1 2 | ||
| 999 |
_c1991 _d1991 |
||