Unverified50% confidenceFactExact time
NP-hard概念由Stephen Cook于1971年在论文《定理证明程序的复杂性》中正式提出，Leonid Levin几乎同时在苏联独立得出类似结论
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
UnverifiedIn 1971, Stephen Cook proved the theory of NP-completeness.72% 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.66% similarUnverified1969年Manna和Waldinger提出了基于形式化规范和定理证明的演绎合成方法63% similarUnverifiedThe Curry–Howard correspondence reveals the structural correspondence in which propositions correspond to types, proofs correspond to programs, and proof normalization corresponds to program execution, and was gradually discovered between 1934 and 196959% similarUnverifiedKen Thompson早在1968年的论文中就描述了高效的NFA模拟算法57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/115509API
curl https://kongchang.com/api/v1/knowledge/claims/115509MCP
get_claim(id=115509)