Computational Complexity

Front Cover
Addison-Wesley, 1994 - Computers - 523 pages
This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. I+ offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the pe@ormance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

ALGORITHMS
1
Turing machines
19
Computability
57
Copyright

19 other sections not shown

Common terms and phrases

Bibliographic information