| 000 | 01009cam a2200301 i 4500 | ||
|---|---|---|---|
| 001 | 2263952 | ||
| 005 | 20221125020002.0 | ||
| 008 | 780814s1979 caua b 001 0 eng | ||
| 010 | _a 78012361 | ||
| 020 |
_a9780716710455 _a9780716710455 |
||
| 040 |
_aDLC _cDLC _dDLC |
||
| 050 | 0 | 0 |
_aQA76.6 _b.G35 |
| 082 | 0 | 0 | _a519.4 GAR/C |
| 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 | 0 | _aA Series of books in the mathematical sciences | |
| 500 | _aIncludes indexes. | ||
| 504 | _aBibliography: p. [291]-325. | ||
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aComputer algorithms. | |
| 650 | 0 | _aComputational complexity. | |
| 700 | 1 |
_aJohnson, David S., _d1945- _ejoint author. |
|
| 740 | _aNP-completeness. | ||
| 906 |
_a7 _bcbc _corignew _d1 _eocip _f19 _gy-gencatlg |
||
| 942 |
_2ddc _cBK _06 |
||
| 999 |
_c7273 _d7273 |
||