Expired60% confidenceFactTime unknown
The P vs NP problem was formally proposed by Stephen Cook in 1971 and is one of the most famous unsolved problems in computer science.
2
Sources
60%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026(expired)
Sources
Related Claims
UnverifiedNP-hard概念由Stephen Cook于1971年在论文《定理证明程序的复杂性》中正式提出，Leonid Levin几乎同时在苏联独立得出类似结论66% similarUnverifiedP=NP是Clay数学研究所悬赏100万美元的千禧年数学难题，至今未被证明62% similarUnverifiedIn 1971, Stephen Cook proved the theory of NP-completeness.62% similarUnverifiedCognitive systems engineering expert Richard Cook wrote "How Complex Systems Fail" in 1998.59% similarUnverifiedCook的论文证明了布尔可满足性问题（SAT）是NP-complete的，Richard Karp于1972年证明了包括背包问题在内的21个经典问题都属于NP-complete56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/60622API
curl https://kongchang.com/api/v1/knowledge/claims/60622MCP
get_claim(id=60622)