Computers and Intractability - A Guide to the Theory of NP-Completeness eBook
A readable, straightforward guide by two authors with extensive experience in the field, Computers and Intractability shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains an extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. Computers and Intractability is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science.
NOM DE FICHIER
Computers and Intractability - A Guide to the Theory of NP-Completeness.pdf
TAILLE DU FICHIER
Computers and Intractability - A Guide to the Theory of NP-Completeness PDF. Découvrez de nouveaux livres avec sennaestube.ch. Télécharger un livre Computers and Intractability - A Guide to the Theory of NP-Completeness en format PDF est plus facile que jamais.
COMPUTERS AND INTRACTABILITY A Guide to the Theory of NP-Completeness Michael R. Garey / David S. Johnson BELL LABORATORIES MURRAY HILL, NEW JERSEY Ш W. H. FREEMAN AND COMPANY New York . Contents Preface ix 1 Computers, Complexity, and Intractability 1 1.1 Introduction 1 1.2 Problems, Algorithms, and Complexity 4 1.3 Polynomial Time Algorithms and Intractable Problems 6 1.4 Provably ...
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. R. Garey, D. S. Johnson and a great selection of related books, art and collectibles available now at AbeBooks.com.