Complexity theory : exploring the limits of efficient algorithms
著者
書誌事項
Complexity theory : exploring the limits of efficient algorithms
Springer, c2005
- タイトル別名
-
Grenzen der Effizienz von Algorithmen
大学図書館所蔵 件 / 全17件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [295]-299) and index
Translation of: Komplexitätstheorie - Grenzen der Effizienz von Algorithmen
内容説明・目次
内容説明
Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models
All topics are considered from an algorithmic point of view stressing the implications for algorithm design
目次
Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions - Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems - Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.
「Nielsen BookData」 より