Unverified50% confidenceFactExact time
Subexponential 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}.
1
Sources
50%
Confidence
Long-term
Relevance
10/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe algorithm's time complexity is log(1/ε)^{O(log^2 d)}, where d is the dimension and ε is the approximation accuracy.73% similarUnverified内点法在理论上具有多项式时间复杂度保证，而单纯形法最坏情况下呈指数级复杂度73% similarUnverifiedFor 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.70% similarUnverifiedIn mathematics, blowup refers to the L∞ norm of the velocity field tending to infinity at some finite time T*67% similarUnverifiedWithout caching, the total time complexity for N steps of generation is roughly on the order of N²·D² + N³·D.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1109885API
curl https://kongchang.com/api/v1/knowledge/claims/1109885MCP
get_claim(id=1109885)