Computational Complexity - Softcover

Papadimitriou, Christos H.

Softcover

ISBN 10: 0201530821 ISBN 13: 9780201530827

Publisher: Pearson, 1994

Synopsis

This 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 NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP 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 fields as computability, logic, number theory, combinatorics and probability.

About this edition

• Publisher: Pearson
• Publication date: 1994
• ISBN 10: 0201530821
• ISBN 13: 9780201530827
• Binding: Paperback
• Edition number: 1
• Number of pages: 544