Unverified50% confidenceFactExact time
The new algorithm achieves a strict exponential speedup on several instance classes, reducing the total running time to O*(2^{(1-γ)n}), where γ>0 is a fixed constant.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor polynomial activation functions and arbitrary compact input sets, this lifting gives a rate of m^{-1/2} under the supremum norm, with an explicit constant.73% similarUnverifiedSubexponential time refers to algorithm running times whose complexity grows more slowly than any exponential function but faster than any polynomial function, commonly of the form 2^{n^ε} (ε<1) or 2^{n/log n}.71% similarUnverifiedFor heterogeneous asynchronous MMAB, a polynomial-time greedy algorithm can achieve a 1/e approximation ratio relative to the optimal centralized assignment.66% similarUnverifiedRegardless of which regime applies, estimators based on compression complexity stably maintain a convergence rate of O(1/√N).65% similarUnverifiedThe easeOutCubic easing function has the form f(t) = 1 − (1 − t)³, and its derivative has maximum speed at the start and approaches zero speed at the end.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114601API
curl https://kongchang.com/api/v1/knowledge/claims/1114601MCP
get_claim(id=1114601)