Unverified50% confidenceFactExact time
In 1971, Stephen Cook proved the theory of NP-completeness.
1
Sources
50%
Confidence
Long-term
Relevance
8/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedNP-hard概念由Stephen Cook于1971年在论文《定理证明程序的复杂性》中正式提出，Leonid Levin几乎同时在苏联独立得出类似结论72% similarUnverified1969年Manna和Waldinger提出了基于形式化规范和定理证明的演绎合成方法64% similarUnverified具身智能的理论根基来自1980年代Rodney Brooks的'包容架构'以及Rolf Pfeifer等人的'物理基础认知'理论63% similarUnverifiedThe P vs NP problem was formally proposed by Stephen Cook in 1971 and is one of the most famous unsolved problems in computer science.62% similarUnverifiedCognitive scientist Philip Johnson-Laird further developed the theory of mental models in 1983, noting that mental models allow humans to engage in offline reasoning.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/786916API
curl https://kongchang.com/api/v1/knowledge/claims/786916MCP
get_claim(id=786916)