| 000 | 01272 a2200409 4500 | ||
|---|---|---|---|
| 999 |
_c72179 _d29873 |
||
| 001 | 72179 | ||
| 003 | TR-AnTOB | ||
| 005 | 20200513134019.0 | ||
| 008 | 110207c19831979nyua b 001 0 d | ||
| 010 | _z78012361 | ||
| 020 | _a0716710455 | ||
| 035 | _a72179 | ||
| 040 |
_aBOS _cBOS _dm/c _dPJU |
||
| 041 | _aeng | ||
| 050 |
_aQA76.6 _b.G35 1983 |
||
| 090 | _aQA76.6 .G35 1983 | ||
| 100 |
_aGarey, Michael R. _948086 |
||
| 245 | 0 |
_aComputers and intractability : _ba guide to the theory of NP-completeness / _cMichael R. Garey, David S. Johnson. |
|
| 264 | 1 |
_aNew York : _bW.H. Freeman, _c1983, c1979. |
|
| 300 |
_ax, 340 p. : _bill. ; _c24 cm. |
||
| 490 | 0 | _aA Series of books in the mathematical sciences. | |
| 500 | _a"Update for the current printing:" p. [339]-340 (dated "December, 1983"). | ||
| 500 | _aIncludes indexes. | ||
| 504 | _aBibliography: p. [291]-325. | ||
| 650 |
_91359 _aComputational complexity |
||
| 650 | 0 |
_aComputer programming _9364 |
|
| 650 |
_aHesaplama karmaşıklığı _921495 |
||
| 650 |
_aAlgorithms _91357 |
||
| 650 |
_aAlgoritmalar _97991 |
||
| 700 |
_aJohnson, David S., _d1945- _948087 |
||
| 740 | _aNP-completeness. | ||
| 902 | _a0026275 | ||
| 903 | _aMerkez Kütüphane | ||
| 942 |
_cBK _2lcc |
||
| 945 | _aSC | ||