Unverified50% confidenceFactExact time

The Cook-Levin theorem proves that the SAT problem is NP-complete.

1

Sources

50%

Confidence

Long-term

Relevance

9/2/2026

First Seen

Sources

Terence Tao Explains 6 Core Mathematical Concepts: From Mathematical Thinking to AI Engineering Practice

Related Entities

Cook-Levin Theoremconcept SAT问题concept NP-Completeconcept

Related Claims

UnverifiedIn 1971, Stephen Cook proved the theory of NP-completeness.64% similar UnverifiedCook的论文证明了布尔可满足性问题（SAT）是NP-complete的，Richard Karp于1972年证明了包括背包问题在内的21个经典问题都属于NP-complete63% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/843219

API

curl https://kongchang.com/api/v1/knowledge/claims/843219

MCP

get_claim(id=843219)