Unverified50% confidenceFactExact time
P=NP是Clay数学研究所悬赏100万美元的千禧年数学难题，至今未被证明
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
Verified克雷数学研究所设立的七个千禧年大奖难题每题奖金百万美元，目前仅黎曼猜想等六题仍未解决64% 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% similarUnverifiedMillennium Prize Problems such as the Riemann Hypothesis, P≠NP, and the smoothness of the Navier-Stokes equations require the creation of entirely new mathematical theoretical frameworks, which current AI is not yet capable of.61% similarUnverifiedThe existence of smooth solutions to the Navier–Stokes equations in three-dimensional space has not yet been mathematically proven, and is one of the Millennium Prize Problems offered by the Clay Mathematics Institute.59% similarUnverified三体问题对任意初始条件都不存在通用的闭式解，庞加莱在19世纪末通过数学证明揭示了其不可积性53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/114322API
curl https://kongchang.com/api/v1/knowledge/claims/114322MCP
get_claim(id=114322)