Michael R. Garey

David S. Johnson

"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.

A Guide to the Theory of NP-completeness

Computers and Intractability

Jan Eijck

Albert Meyer

The logic of information flow has applications in both computer science and natural language processing and is a growing area within mathematical and philosophical logic.

Michael R. Garey

About

Books

Join the club