Computer and intractability: a guide to the theory of NP-completeness pdf
Par kelly linda le mercredi, juin 7 2017, 22:39 - Lien permanent
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.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
Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. Freeman, ISBN-10: 0716710455; D. Johnson 351 0716710447,9780716710455,9780716710448,0716710455. If, on the other hand, Q is indefinite, then the problem is NP-hard. Freeman, New York, NY, USA, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. In fact Computers and Intractability: A Guide to the Theory of NP-Completeness. Besides the Lagrangian duality theory, there are other duality pairings (e.g. Freeman Company, November 1990. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R.