Computer and intractability: a guide to the theory of NP-completeness. David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness


Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb


Download Computer and intractability: a guide to the theory of NP-completeness



Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd




The electronic version of this article is the complete one and can be found online at: http://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of NP-completeness. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). This book has been the very first book on NP-completeness. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Ņ�中的图论教授,数次向我们讲解“P对NP”的核心,并推荐了名著《GAREY M R, JOHNSON D S. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. MARKET: An ideal reference for Web programming professionals. NET Using C# and Ajax; Visual Studio; Database Access through the Web; Ruby; Rails 2.0; Ajax. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Computers and Intractability; A Guide to the Theory of NP-Completeness .