Computers and Intractability PDF
By:Michael R. Garey,David S. Johnson
Published on 1979 by W.H. Freeman
|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.
This Book was ranked at 20 by Google Books for keyword mathematics symbol.
Book ID of Computers and Intractability's Books is fjxGAQAAIAAJ, Book which was written byMichael R. Garey,David S. Johnsonhave ETAG "0CMriAzgSc4"
Book which was published by W.H. Freeman since 1979 have ISBNs, ISBN 13 Code is and ISBN 10 Code is
Reading Mode in Text Status is false and Reading Mode in Image Status is false
Book which have "338 Pages" is Printed at BOOK under CategoryAlgorithms
Book was written in en
eBook Version Availability Status at PDF is falseand in ePub is false
Book Preview
Download Computers and Intractability PDF Free
Download Computers and Intractability Books Free
Download Computers and Intractability Free
Download Computers and Intractability PDF
Download Computers and Intractability Books
No comments:
Post a Comment