| 000 | 00662 a2200289 4500 | ||
|---|---|---|---|
| 001 | 2545 | ||
| 020 | _a0-7167-1044-725 | ||
| 041 | _aeng | ||
| 080 | _a681.3:518.6 Gar | ||
| 245 | _aComputers and intractability : a guide to the theory of NP-completeness | ||
| 250 | _a | ||
| 260 | _aSan Francisco | ||
| 260 | _bW.H. Freeman, | ||
| 260 | _c1979 | ||
| 300 | _ax,338 p. | ||
| 300 | _c23 cm | ||
| 490 | _a | ||
| 100 | _aGarey, Michael R. | ||
| 700 | _aJohnson, David S. | ||
| 700 | _a | ||
| 650 | _a | ||
| 650 | _aElectronic digital computer-Programming | ||
| 650 | _aAlgorithms | ||
| 650 | _aComputational complexity | ||
| 942 | _cBK | ||
| 942 | _2UDC | ||
| 999 |
_c3327 _d3327 |
||