Unverified50% confidenceFactExact time

ETH asserts that for NP-complete problems such as 3-SAT, there is no algorithm that runs in subexponential time (that is, O(2^{o(n)})).

1

Sources

50%

Confidence

Long-term

Relevance

10/27/2026

First Seen

Sources

AI Models Claim to Refute Computational Complexity Hypothesis? Experts Weigh In

Related Entities

Exponential Time Hypothesisconcept 3-SATconcept

Related Claims

UnverifiedMaximum Iteration is unrelated to a basic LLM, because a single input-output call has no concept of a loop.52% similar UnverifiedThe C standard does not require functions to reset errno to 0 on success.51% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/1104575

API

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

MCP

get_claim(id=1104575)