Read Anywhere and on Any Device!

Special Offer | $0.00

Join Today And Start a 30-Day Free Trial and Get Exclusive Member Benefits to Access Millions Books for Free!

Create Free Account

Quick and Easy Sign Up!

It takes less then 1 minute to sign up, then you can enjoy Unlimited eBooks.

Sign Up Browse

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Unknown Author
4.9/5 (14507 ratings)
Read Now Download Now ⏭ listen AudioBook
Description: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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). To get started finding Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.
Pages
—
Format
PDF, EPUB & Kindle Edition
Publisher
—
Release
—
ISBN
0716710455

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Unknown Author
4.4/5 (1290744 ratings)
Read Now Download now ⏭ listen AudioBook
Description: 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.We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). To get started finding Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.
Pages
—
Format
PDF, EPUB & Kindle Edition
Publisher
—
Release
—
ISBN
0716710455

More Books

Computers and Intractability

Computers and Intractability

4.4/5 (1,282,506 ratings)

Computational Science and Its Applications – ICCSA 2024

Computational Science and Its Applications – ICCSA 2024

4.2/5 (4,466 ratings)

Basics of Computer Science Guidebook

Basics of Computer Science Guidebook

4.1/5 (1,751 ratings)

Graph-related Optimization and Decision Support Systems

Graph-related Optimization and Decision Support Systems

4.5/5 (743 ratings)

Analysis, Cryptography And Information Science

Analysis, Cryptography And Information Science

4/5 (647 ratings)

Computer Science

Computer Science

4/5 (647 ratings)

ACM Transactions on Modeling and Computer Simulation

ACM Transactions on Modeling and Computer Simulation

4.7/5 (647 ratings)

1990 Lectures In Complex Systems

1990 Lectures In Complex Systems

4.6/5 (647 ratings)

CMU Computer Science

CMU Computer Science

4.9/5 (647 ratings)
loader