000 01280n a2200385#a 4500
001 22698
003 P5A
005 20240823105432.0
008 780814s1979 caua b 001 0 eng||
010 _a78012361 //r842
020 _a0716710447
_qpbk.
020 _a0716710455
035 _aocm04195125
040 _aDLC
_cIMPA
049 _aP5AA
082 0 0 _a005
_bG229c
090 _ama12
100 1 _aGarey, Michael R.
_923478
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 2 _aSeries of books in the mathematical sciences;
500 _aIncludes indexes.
504 _aBibliography: p. [291]-325.
650 0 _aProgramming (Electronic computers)
_937148
650 7 _aProgramacao De Computadores
_922705
_2larpcal
650 7 _aAlgoritmos E Estruturas De Dados.
_922719
_2larpcal
650 0 _aComputer algorithms.
_931281
650 0 4 _aComputational complexity.
_943792
697 _aMatemática Aplicada 12-
_xInformática.
_923759
700 1 _aJohnson, David S.,
_d1945-
_ejoint author.
_945229
740 0 _aNP-completeness.
942 _2impa
_cBK
999 _c22863
_d22863