Unverified50% confidenceFactExact time
The core assertion of ETH is that no algorithm solves 3-SAT in subexponential time, specifically in the form 2^Ω(n).
1
Sources
50%
Confidence
Long-term
Relevance
10/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedETH 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.69% similarUnverified三体问题在任意初始条件下不存在通用的闭式解，绝大多数配置只能通过数值方法演化求解66% similarUnverifiedAn open problem in mathematics refers to a proposition for which the mathematical community has not yet reached a recognized answer61% similarUnverifiedThe threshold ε0 in the proof of the ε-disconnected non-existence result is explicitly computable in terms of the problem parameters: below it the non-existence result holds, and above it the conclusion is undetermined.60% similarUnverifiedAI scheduling logic only compares free blocks on the calendar and does not verify people's actual state.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1101456API
curl https://kongchang.com/api/v1/knowledge/claims/1101456MCP
get_claim(id=1101456)