Unverified50% confidenceFactExact time
SAT (the Boolean satisfiability problem) is the first problem proved to be NP-complete.
1
Sources
50%
Confidence
Long-term
Relevance
11/1/2026
First Seen
Sources
AI Cracks the Unique Games Conjecture: A Turning Point for Theoretical Computer Science
youtubeLex Clips11/1/2026
Related Entities
Cite This Claim
Stable URI
https://kongchang.com/claim/1122425API
curl https://kongchang.com/api/v1/knowledge/claims/1122425MCP
get_claim(id=1122425)