LEADER 01639nam0 2200349 i 450 
001 VAN00029736
005 20250317114245.577
010   $a07-16-71045-5
010   $a978-07-16-71045-5
100   $a20041207r19791997   |0itac50      ba
101   $aeng
102   $aUS
105   $a||||    |||||
200 1 $aComputers and intractability$ea guide to the theory of NP-completeness$fMichael R. Garey, David S. Johnson
205   $a9. printing
210   $aNew York$cFreeman$dstampa 1997
215   $aX, 338 p.$cill.$d24 cm
410  1$1001VAN00089826$12001 $aˆA ‰series of books in the mathematical sciences$1210  $aNew York$cFreeman
606   $a68-XX$xComputer science [MSC 2020]$3VANC019670$2MF
606   $a90-XX$xOperations research, mathematical programming [MSC 2020]$3VANC025650$2MF
606   $a94-XX$xInformation and communication theory, circuits [MSC 2020]$3VANC019701$2MF
620   $aUS$dNew York$3VANL000011
700  1$aGarey$bMichael R.$3VANV024649$062169
701  1$aJohnson$bDavid S.$3VANV024650$062170
712   $a*Freeman <editore>$3VANV108064$4650
801   $aIT$bSOL$c20251003$gRICA
856 4 $u/sebina/repository/catalogazione/documenti/ID 29736.pdf$zID 29736.pdf
912   $aVAN00029736
950   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST     68-XX                   1545        $e08   3834      I a     20041207            
950   $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08PREST     68-XX                   1545        $e08   4566      I b     20041209            
996   $aComputers and intractability$91431547
997   $aUNICAMPANIA