Bookbot

Computational Complexity

En savoir plus sur le livre

This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. It 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. 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.

Achat du livre

Computational Complexity, Christos H. Papadimitriou

Langue
Année de publication
1993
product-detail.submit-box.info.binding
(souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.

Modes de paiement

Personne n'a encore évalué .Évaluer

Titre
Computational Complexity
Langue
Anglais
Éditeur
Pearson
Publié
1993
Format
souple
Pages
523
ISBN10
0201530821
ISBN13
9780201530827
Séries
Description
This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. It 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. 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.