算法与计算理论 / Algorithms and Computation Theory
NP完全性理论
NP-Completeness TheoryNP完全性理论（Cook–Levin theorem）是数学理论层中的真实知识点；参考资料将其年代记为1971 年。
- Knowledge type
- 数学理论
- First proposed or discovered
- 1971
- Proposer
- 历史记录与科学共同体
- Creator
- Polytech Tree dataset
- Last updated
- 2026-10-12 07:25:30
Sub-knowledge points
No connected node yet
Higher-order knowledge points
Main parameters and performance indicators
重要度：1参考分类：算法与计算理论
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starshttps://en.wikipedia.org/wiki/Cook%E2%80%93Levin_theoremOpen source
https://github.com/secwind7/polytech-treeOpen source
Related products and links
No item recorded yet
Creation and modification trail
0 recordsThis static seed node has no database modification event yet.
Node update feedback
review required