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

Michael R. Garey; David S. Johnson

ISBN 10: 0716710455 / ISBN 13: 9780716710455

Verlag: W. H. Freeman (edition First Edition), 1979

It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Bestandsnummer des Verkäufers 0716710455-8-1

Inhaltsangabe:

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.

Bibliografische Details

Titel: Computers and Intractability: A Guide to the...
Verlag: W. H. Freeman (edition First Edition)
Erscheinungsdatum: 1979
Einband: Paperback
Zustand: Very Good
Auflage: First Edition.