Computers and Intractability A Guide to the Theory of NP Completeness In computer science specifically computational complexity theory Computers and Intractability A Guide to the Theory of NP Completeness is an influential textbook by Michael Garey and David S Johnson
In computer science, specifically computational complexity theory, Computers and Intractability A Guide to the Theory of NP Completeness is an influential textbook by Michael Garey and David S Johnson It was the first book exclusively on the theory of NP completeness and computational intractability The book features an appendix providing a thorough compendium ofIn computer science, specifically computational complexity theory, Computers and Intractability A Guide to the Theory of NP Completeness is an influential textbook by Michael Garey and David S Johnson It was the first book exclusively on the theory of NP completeness and computational intractability The book features an appendix providing a thorough compendium of NP complete problems which was updated in later printings of the book The book is now outdated in some respects as it does not cover recent development such as the PCP theorem It is nevertheless still in print and is regarded as a classic in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

[PDF] Download ç Computers and Intractability: A Guide to the Theory of NPCompleteness  by ☆ Michael R. Garey David S. Johnson 119 Michael R. Garey David S. Johnson

Title: [PDF] Download ç Computers and Intractability: A Guide to the Theory of NPCompleteness  by ☆ Michael R. Garey David S. Johnson
Posted by:
Published :20180411T02:11:51+00:00
as an introduction to NPcompleteness, it's good. as a reference on NPcompleteness it's by far the best. like 200 pages of NPcomplete problems with references to NPhard problems to reduce to prove NPcompleteness.
The first really good book on the class NP I've found  an absolute lifesaver when I realized how little I understood the core of NP.
The tables of problem types are nice. They're also known mathematical results; you don't have to pay money to get them. (That may not have been true when this book was first published.)NPCompleteness restates some properites of elementary functions, in a way that makes them seem mysterious. It turns out that 1) a polynomial= the same polynomial wearing a giant, obtrusive disguiseand can be transformed to another polynomial.2) If I put an obtrusive disguise on an exponential function, it won't [...]
Только из этой книги понял про P/NP/NPcomplete.До этого, в куче мест, в том числе в курсе Седжвика на coursera видел какието попытки объяснять это "на пальцах", что совершенно невнятно.Была непонятна сама общая идея, как можно определять, что некая задача NPcomplete, при этом не зная, нет ли [...]
analisis
A mustread for those studying complexity theory