Unverified50% confidenceFactExact time
Overturning ETH does not directly imply P=NP, but it removes an important theoretical obstacle.
1
Sources
50%
Confidence
Long-term
Relevance
10/28/2026
First Seen
Sources
Related Entities
Related Claims
Partially VerifiedETH has not been proved or disproved to date, but it has become a cornerstone assumption in fields such as parameterized complexity and exact algorithm design.66% similarUnverifiedThe core assertion of ETH is that no algorithm solves 3-SAT in subexponential time, specifically in the form 2^Ω(n).60% similarUnverifiedIf ETH is disproven, SETH naturally does not hold; but the converse does not hold—disproving SETH does not necessarily refute ETH.59% similarUnverifiedIf this theory holds, the common assumptions of current AI safety evaluation methods are fundamentally overturned.58% similarUnverifiedThe paper does not address whether ERM on the truncated network class is easy to find in practical optimization (the optimization landscape problem), nor whether the conclusions can be extended to non-uniform error or more general function spaces.56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1109884API
curl https://kongchang.com/api/v1/knowledge/claims/1109884MCP
get_claim(id=1109884)