P, NP, and NP-Completeness: The Basics of Computational Complexity
简介：
这个本科对计算复杂性的介绍为理论计算机科学中的两个核心问题提供了广泛的视角。本书首先介绍了可计算性的相关背景，包括图灵机、搜索和决策问题、算法、电路和复杂性类，然后重点介绍了P对NP问题和NP完备性理论。
英文简介：
This undergraduate introduction to computational complexity offers a wide perspective on two central issues in theoretical computer science. The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness.
- 书名
- P, NP, and NP-Completeness: The Basics of Computational Complexity
- 译名
- P、NP 和 NP 完全性：计算复杂性的基础
- 语言
- 英语
- 年份
- 2008
- 页数
- 145页
- 大小
- 1013.45 kB
- 下载
P, NP, and NP-Completeness: The Basics of Computational Complexity.pdf- 密码
- 65536
最后更新：2025-04-12 23:57:46