Source: M. Garey and D. S. Johnson. Computers and ... · almost as good. The theory of NP-completeness provides many straightfor- ward techniques for proving that a given problem
3
Source: M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. W. H. Freemand and Company, San Francisco, CA, 1979, pp. 2–3. 1
Source: M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freemand and Company, San Francisco, CA, 1979, pp. 2–3.