Computer and intractability: a guide to the theory of NP-completeness book
Par jackson curtis le lundi, mars 13 2017, 07: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 book
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Publisher: W.H.Freeman & Co Ltd
Page: 175
ISBN: 0716710447, 9780716710448
Format: djvu
ACM Queue, 5:16–21, November 2007. Handbook of Algorithms and Data Structures. �Algorithm for Solving Large-scale 0-. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. Computers and Intractability: A Guide to the Theory of NP-completeness. Computers and Intractability: A Guide to the. Computers and Intractibility: A Guide to the Theory of NP-Completeness. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Computers and Intractability: A Guide to the Theory of NP-Completeness. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory.