Garey, Michael R. <br/><br/>
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; .
<br/><br/> Includes indexes. 
<br/><br/>Bibliography: p. [291]-325. 
<br/><br/><label>ISBN: </label>0716710447 0716710455 
<br/><br/><label>LCCN: </label>78012361 //r842 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Programming (Electronic computers)<br/>Programacao De Computadores<br/>Algoritmos E Estruturas De Dados.<br/>Computer algorithms.<br/>Computational complexity.
<br/><br/><label>Dewey Class. No.: </label>005  / G229c