P, NP, and NP-completeness : the basics of computational complexity
著者
書誌事項
P, NP, and NP-completeness : the basics of computational complexity
Cambridge University Press, 2010
- : hbk
- : pbk
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
目次
- 1. Computational tasks and models
- 2. The P versus NP Question
- 3. Polynomial-time reductions
- 4. NP-completeness
- 5. Three relatively advanced topics
- Epilogue: a brief overview of complexity theory.
「Nielsen BookData」 より
