Computational Complexity

Papadimitriou, Christos H.

ISBN 10: 0201530821 / ISBN 13: 9780201530827

Edité par Pearson, 1993

A propos de cet article

Paperback 100% of proceeds go to charity! Acceptable reading copy with obvious signs of use, wear, and/or cosmetic issues. Item is complete and remains readable despite notable condition issues. N° de réf. du vendeur G-01-4733

Détails bibliographiques

Titre : Computational Complexity

Éditeur : Pearson

Date d'édition : 1993

Reliure : Couverture souple

Etat : Acceptable

A propos de ce titre

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.

Quatrième de couverture:

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 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 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 challeging problems.

0201530821B04062001