Unverified50% confidenceFactExact time
For nonsmooth nonconvex problems, the known optimal first-order complexity is O(ε^{-3}) and the zeroth-order complexity is O(d ε^{-3}).
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe complexity given in the paper under zeroth-order access (function value queries) is O(dδ⁻¹ε⁻³), where d is the problem dimension.77% similarUnverified直接在SO(3)上做卷积的朴素复杂度为O(B^6)，通过快速球面傅里叶变换（基于Driscoll-Healy或McEwen-Wiaux采样定理）可降低至O(B^5)甚至更低76% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)74% similarUnverifiedRegardless of which regime applies, estimators based on compression complexity stably maintain a convergence rate of O(1/√N).73% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.73% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012945API
curl https://kongchang.com/api/v1/knowledge/claims/1012945MCP
get_claim(id=1012945)