Computers and Intractability: A Guide to the Theory of NP-Completeness
Book
Domain Context
Computation and Complexity
Citation
Michael R. Garey and David S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
Why this reference is included
Garey and Johnson’s Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) is part of the program’s reference corpus as standard domain context for Computation and Complexity. It is not directly cited in the currently published volumes of Panta Rhei, but is retained as part of the research shelf.
Corpus status
In the corpus only This reference is part of the research corpus but is not directly cited in the currently published volumes of Panta Rhei.