Computer and intractability: a guide to the theory of NP-completeness pdf
Par martin abel le mercredi, octobre 19 2016, 00:21 - 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
Page: 175
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. It comes from Computers and Intractability—A Guide to the Theory of NP-Completeness by Garey and Johnson, which uses set to express the clauses. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness. Freeman Company, November 1990. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. Garey, Michael R., and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. Computers and Intractability – A Guide to the Theory of NP-Completeness. Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, 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”.