MARC状态:审校 文献类型:西文图书 浏览次数:5
- 题名/责任者:
- The nature of computation / Christopher Moore, Stephan Mertens = 计算的本质 / [美] 克里斯托弗 · 摩尔, [德] 斯蒂芬 · 默滕斯著.
- 出版发行项:
- 北京 : 世界图书出版公司, 2023.
- ISBN:
- 9787523206591 :
- 载体形态项:
- xviii, 985 pages : illustrations ; 24 cm
- 变异题名:
- 计算的本质
- 个人责任者:
- Moore, Christopher author.
- 附加个人名称:
- Mertens, Stephan author.
- 中图法分类号:
- O24
- 书目附注:
- Includes bibliographical references and index.
- 摘要附注:
- Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, cryptography, and quantum computing are usually considered too "advanced" to show to the typical student. The aim of this book is to bridge both gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non computer scientists and to computer scientists who finally want to understand what their formalisms are actually telling.This book gives a lucid and playful explanation of the field, starting with P and NP-completeness. The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduates and undergraduates, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.
全部MARC细节信息>>
| 索书号 | 条码号 | 年卷期 | 馆藏地 | 书刊状态 | 还书位置 |
| O24/X1 | 2297849 | 经济书库-外文图书417
|
可借 | 经济书库-外文图书417 |
显示全部馆藏信息




经济书库-外文图书417