Unverified90% confidenceFactTime unknown
Gated Delta Net将状态空间复杂度从标准注意力的O(N²)降到O(N)量级
1
Sources
90%
Confidence
Long-term
Relevance
6/1/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).69% similarUnverified滑动窗口注意力由 Beltagy 等人在 Longformer（2020）中提出，将复杂度从 O(n²) 降至 O(n×w)68% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks64% similarUnverified四叉树空间索引可使碰撞检测的时间复杂度从O(n²)降低至O(n log n)量级64% 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.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/18086API
curl https://kongchang.com/api/v1/knowledge/claims/18086MCP
get_claim(id=18086)