Partially Verified65% confidenceFactExact time
3-SAT is the first problem proven NP-complete (a special case of the Cook-Levin theorem).
3
Sources
65%
Confidence
Long-term
Relevance
10/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Cook-Levin theorem proves that the SAT problem is NP-complete.70% similarUnverified三体问题对任意初始条件都不存在通用的闭式解，庞加莱在19世纪末通过数学证明揭示了其不可积性60% similarUnverifiedCook的论文证明了布尔可满足性问题（SAT）是NP-complete的，Richard Karp于1972年证明了包括背包问题在内的21个经典问题都属于NP-complete58% similarUnverifiedThe paper's validation is currently focused on three-dimensional Navier–Stokes dynamics scenarios, and whether it can be generalized to a broader range of vector-valued PDE problems remains to be investigated in future research.53% similarUnverifiedIn 1971, Stephen Cook proved the theory of NP-completeness.53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1101461API
curl https://kongchang.com/api/v1/knowledge/claims/1101461MCP
get_claim(id=1101461)