Computational Complexity

  • Addison Wesley
3.00
  • (0)
  • (0)
  • (1)
  • (0)
  • (0)
本棚登録 : 2
レビュー : 1
  • Amazon.co.jp ・洋書 (500ページ)
  • / ISBN・EAN: 9780201530827

作品紹介・あらすじ

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.

感想・レビュー・書評

並び替え
表示形式
表示件数
絞り込み
  • 洋書ですが、統括されていてとてもいい。
    表紙はなぜかミロのビーナス

全1件中 1 - 1件を表示

Christos H.Papadimitriouの作品

Computational Complexityを本棚に登録しているひと

新しい本棚登録 1
新しい本棚登録 0
新しい本棚登録 0
新しい本棚登録 0
新しい本棚登録 0
ツイートする
×