Computer and intractability: a guide to the theory of NP-completeness. David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness


Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb




Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd




Freeman Company, November 1990. Solving a system of non-linear modular arithmetic equations is NP-complete. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. For details, see for example M. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Computers and Intractability – A Guide to the Theory of NP-Completeness.

Other ebooks:
Mfc Programming With Visual C++ 6 Unleashed epub