Book summary

Computers and Intractability: A Guide to the Theory of NP-Completeness ebook download free

In computer science, more 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 more 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.

Computers and Intractability: A Guide to the Theory of NP-Completeness ebook download free; pdf for free or read online available on pdf epub and mobi in our library is free unlimited for you. We provide copy of Computers and Intractability: A Guide to the Theory of NP-Completeness; in digital format pdf, txt, epub, kindle and other this book for free completely free of charge.

Book author

Michael R. Garey ebooks download free

Michael R. Garey

Author bio missing.

 

PDF

PDF (Portable Document Format) is a file format that has captured all the elements of a printed document as an electronic image that you can view, navigate, print, or forward to someone else.

MOBI

A file with the .MOBI file extension is used for storing eBooks. It was originally a Mobipocket Reader format but has since been adopted by several different readers as well.

EPUB

The EPUB file format (short for electronic publication) is an e-book format with the extension .epub.