Unverified50% confidenceFactExact time
The basic form of ETH asserts that for the 3-SAT problem, any algorithm has a worst-case time complexity of at least 2^{δn}, where n is the number of variables and δ is some positive constant.
1
Sources
50%
Confidence
Long-term
Relevance
10/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhen using exact rational arithmetic, the bit length of intermediate rational numbers in the classical LLL algorithm can reach O(n·β) in the worst case, with an overall complexity of O(n⁵·β³) or even higher.73% similarUnverifiedFor nonsmooth nonconvex problems, the known optimal first-order complexity is O(ε^{-3}) and the zeroth-order complexity is O(d ε^{-3}).70% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)66% similarUnverifiedTheoretical analysis shows that the algorithm outputs an ε-close hypothesis with high probability, with both sample complexity and time complexity being poly(d, k, 1/ε).66% similarUnverifiedIn the agnostic learning setting, the gap between the sample complexity of every ERM and the known lower bound is at most the ratio of the DS dimension to the Natarajan dimension multiplied by a constant.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1101255API
curl https://kongchang.com/api/v1/knowledge/claims/1101255MCP
get_claim(id=1101255)