Unverified50% confidenceFactExact time
Cook的论文证明了布尔可满足性问题（SAT）是NP-complete的，Richard Karp于1972年证明了包括背包问题在内的21个经典问题都属于NP-complete
1
Sources
50%
Confidence
Long-term
Relevance
7/6/2026
First Seen
Sources
Greedy Algorithms and the Knapsack Problem: Core Notes from MIT 6.0002 Lecture 1
bilibiliAI从零开始学7/3/2026
Related Claims
UnverifiedThe P vs NP problem was formally proposed by Stephen Cook in 1971 and is one of the most famous unsolved problems in computer science.56% similarUnverifiedIn 1971, Stephen Cook proved the theory of NP-completeness.53% similarUnverifiedNP-hard概念由Stephen Cook于1971年在论文《定理证明程序的复杂性》中正式提出，Leonid Levin几乎同时在苏联独立得出类似结论52% similarUnverifiedLeslie Kaelbling在1998年发表的经典论文提出了高效的POMDP近似求解算法51% similarUnverified物理学家理查德·费曼保持着一个'十二个最喜欢的问题'的心理清单，用于检验新发现能否推进这些问题的解答50% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/115510API
curl https://kongchang.com/api/v1/knowledge/claims/115510MCP
get_claim(id=115510)