Unverified50% confidenceFactExact time
If ETH holds, then no O(n^{2-ε}) algorithm exists for the edit distance problem; if SETH holds, problems such as dynamic time warping also have similar lower bounds.
1
Sources
50%
Confidence
Long-term
Relevance
10/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe 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.74% similarUnverifiedThe linear-time recurrent layer runs at inference with O(1) per-token state-update complexity, offering constant memory footprint and high throughput, but its long-range precise retrieval capability is limited by state capacity.65% similarUnverifiedIn a continuous convex action space, discretizing the action space and applying the discrete algorithm can yield Õ(md+k) regret, but the number of grid points required grows exponentially with the dimension d, making the algorithm infeasible in polynomial time.64% similarUnverifiedThe classic Hedge algorithm achieves O(√(T log N)) regret under oblivious input, and this bound is tight in general.63% similarUnverifiedBy eliminating the token-by-token generation loop, the time complexity of a single inference is reduced from O(n) to approximately constant, giving a clear throughput advantage in high-concurrency routing scenarios62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1101464API
curl https://kongchang.com/api/v1/knowledge/claims/1101464MCP
get_claim(id=1101464)