Computer and intractability: a guide to the theory of NP-completeness download
Par kreutzer beatrice le jeudi, juin 22 2017, 07:53 - 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
Page: 175
Format: djvu
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Handbook of Algorithms and Data Structures. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Most of the setbacks within this plan are admitted bask in Garey also Johnson's seminal book Computers as well as Intractability: A Guide to the Theory of NP-Completeness , also are here given indoors the identical course also organization. Solving a system of non-linear modular arithmetic equations is NP-complete. For details, see for example M. Computers and Intractibility: A Guide to the Theory of NP-Completeness. �Algorithm for Solving Large-scale 0-. 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. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. [7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman Company, November 1990. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp.