Computers and intractability: a guide to the theory of NP-completeness/
Garey, Michael R.
Computers and intractability: a guide to the theory of NP-completeness/ Michael R. Garey, David S. Johnson. - San Francisco: W.H. Freeman, c1979. - x, 338 p.: ill.; 24 cm. - Series of books in the mathematical sciences; .
Includes indexes.
Bibliography: p. [291]-325.
0716710447 0716710455
78012361 //r842
Programming (Electronic computers)
Programacao De Computadores
Algoritmos E Estruturas De Dados.
Computer algorithms.
Computational complexity.
005 / G229c
Computers and intractability: a guide to the theory of NP-completeness/ Michael R. Garey, David S. Johnson. - San Francisco: W.H. Freeman, c1979. - x, 338 p.: ill.; 24 cm. - Series of books in the mathematical sciences; .
Includes indexes.
Bibliography: p. [291]-325.
0716710447 0716710455
78012361 //r842
Programming (Electronic computers)
Programacao De Computadores
Algoritmos E Estruturas De Dados.
Computer algorithms.
Computational complexity.
005 / G229c