Computer and intractability: a guide to the theory of NP-completeness download
Par walker pedro le vendredi, décembre 18 2015, 20: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
ISBN: 0716710447, 9780716710448
Format: djvu
Publisher: W.H.Freeman & Co Ltd
Page: 175
Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Computers and Intractability: A Guide to the Theory of NP-completeness. Ɂ�去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". Computers and Intractability: A Guide to the Theory of Np-Completeness. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Computers and Intractability a guide to the theory of NP-completeness. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. Solving a system of non-linear modular arithmetic equations is NP-complete. Freeman | 1979 | ISBN: 0716710455 | 340. 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. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. Freeman & Co., New York, NY, USA. For details, see for example M. Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W.