Computer and intractability: a guide to the theory of NP-completeness ebook
Par paille doris le dimanche, septembre 11 2016, 04:17 - Lien permanent
Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Format: djvu
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Page: 175
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Computers and Intractability; A Guide to the Theory of NP-Completeness . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, NY, USA, 1979. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. This concept of NP-Complete gives light to the image that became famous in the book by Garey and Johnson “Computers and Intractability: A Guide to the Theory of NP-Completeness”. Freeman | 1979 | ISBN: 0716710455 | 340. Free download ebook Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) pdf.