| 000 | 01217nam a2200349 a 4500 | ||
|---|---|---|---|
| 005 | 20250913113835.0 | ||
| 008 | 981208s1979 caua 001 0 eng | ||
| 010 | _a78-012361 | ||
| 020 | _a0716710447 | ||
| 020 | _a0716710455 (pbk) | ||
| 039 | 9 |
_a200801021259 _bzaiful _c200801021251 _dzaiful _y08-18-1999 _zload |
|
| 090 | _aQA76.6.G35[00008033322] | ||
| 090 |
_aQA76.6 _b.G35 |
||
| 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, _c1979 |
||
| 300 |
_ax, 338 p. : _bill. ; _c24 cm. |
||
| 440 | 2 | _aA Series of books in the mathematical sciences | |
| 500 | _aIncludes indexes | ||
| 504 | _aBibliography: p. 291 -325 | ||
| 650 | 0 |
_aElectronic digital computers _xProgramming |
|
| 650 | 0 | _aAlgorithms | |
| 650 | 0 | _aComputational complexity | |
| 700 | 1 |
_aJohnson, David S., _d1945- |
|
| 740 | _aNP-completeness | ||
| 907 |
_a.b10425858 _b2021-05-28 _c2019-11-12 |
||
| 942 |
_c01 _n0 _kQA76.6.G35[00008033322] |
||
| 914 | _avtls000044338 | ||
| 991 | _aFak Sains Matematik | ||
| 998 |
_al _at _b1999-05-08 _cm _da _feng _gcau _y0 _z.b10425858 |
||
| 999 |
_c44546 _d44546 |
||