Computers And Intractability
Download Computers And Intractability full books in PDF, epub, and Kindle. Read online free Computers And Intractability ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Computers and Intractability
Author | : Michael R. Garey |
Publisher | : W.H. Freeman |
Total Pages | : 364 |
Release | : 1979 |
Genre | : Algorithms |
ISBN | : |
Download Computers and Intractability Book in PDF, Epub and Kindle
"Shows how to recognize NP-complete problems and offers proactical 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 and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] 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"--Back cover.
Computers and Intractability Related Books
Pages: 364
Pages: 404
Pages: 1498
Pages: 296
Pages: