Computational Complexity - Couverture souple

Papadimitriou, Christos-H

Couverture souple

ISBN 10 : 0201530821 ISBN 13 : 9780201530827

Editeur : 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.

A propos du livre

À propos de la 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

Détails de l'édition

• Éditeur: Pearson
• Date d'édition: 1994
• Langue: anglais
• ISBN 10: 0201530821
• ISBN 13: 9780201530827
• Reliure: Broché
• Numéro d'édition: 1
• Nombre de pages: 544
• Coordonnées du fabricant: non disponible
• Personne responsable: Riccardo Bacigalupo; riccardo.bacigalupo@sanoma.it; ; Sanoma Italia Via Arconati, 1 �; Milano; 20135; Italie