Computational Complexity 94 edition (9780201530827) - Textbooks.com
Ship-Ship-Hooray! Free Shipping on $25+ Details >
Computational Complexity

Computational Complexity - 94 edition

Computational Complexity - 94 edition

ISBN13: 9780201530827

ISBN10: 0201530821

Computational Complexity by Christos H. Papadimitriou - ISBN 9780201530827
Edition: 94
Copyright: 1994
Publisher: Addison-Wesley Longman, Inc.
Published:
International: No
Computational Complexity by Christos H. Papadimitriou - ISBN 9780201530827

ISBN13: 9780201530827

ISBN10: 0201530821


shop us with confidence

Summary

This new text 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 performance and limitations of computer algorithms. Among topics covered are: reductions and completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the question, parallel computation, the polynomial hierarchy, and many others.

Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self- contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.

Features

  • First unified introduction to computational complexity.
  • Integrates computation, applications, and logic throughout.
  • Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.
  • Includes extensive exercises including historical notes, references, and challenging problems.

Table of Contents

Table of Contents

Algorithms.

Logic.

P and NP.

Inside P.

Beyond NP.