000 01288nam a2200313 a 4500
001 2263952
008 110223s1979 nyua b 001 0 eng d
010 _a 78012361
020 _a0716710447
020 _a0716710455
022 _a9780716710448
022 _a978071670455
040 _aDLC
_cDLC
_dDLC
_dBD-DhAAL
082 0 0 _a519.4
_222
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 _aNew York ;
_aHoundmills ;
_aSan Francisco :
_bW. H. Freeman,
_cc1979.
300 _ax, 338 p. :
_bill. ;
_c24 cm.
490 0 _aA Series of books in the mathematical sciences
504 _aIncludes index and Bibliography (p. [291]-325.)
650 0 _aComputer programming.
650 0 _aComputer algorithms.
650 0 _aComputational complexity.
700 1 _aJohnson, David S.,
_d1945-
_ejoint author.
999 _c10475
_d10475
952 _p3010021976
_40
_eKarim International
_00
_bBRACUL
_10
_o519.4 GAR
_d2011-02-24
_t1
_70
_cGEN
_2ddc
_g5,170 Tk.
_yBK
_aBRACUL
952 _p3010022023
_40
_00
_bBRACUL
_10
_o519.4 GAR
_d2011-03-30
_t2
_70
_cGEN
_2ddc
_yBK
_aBRACUL