Unverified90% confidenceFactTime unknown
Gated Delta Net将状态空间复杂度从标准注意力的O(N²)降到O(N)量级
1
Sources
90%
Confidence
Long-term
Relevance
6/1/2026
First Seen
Sources
Qwen3.5深度解析：混合注意力架构实现19倍长上下文加速
bilibili雪天鱼
Related Entities
Related Claims
Unverified快速傅里叶变换将DFT的计算复杂度从朴素的O(N²)降低到O(N log N)69% similarUnverified滑动窗口注意力由 Beltagy 等人在 Longformer（2020）中提出，将复杂度从 O(n²) 降至 O(n×w)68% similarUnverifiedEKF-SLAM的计算复杂度为O(n²)，因为协方差矩阵维度随地标数量线性增长64% similarUnverified四叉树空间索引可使碰撞检测的时间复杂度从O(n²)降低至O(n log n)量级64% similarUnverified分解子域策略可将步数复杂度从O((L/w)²)降低到O(L²/(N·w²))，其中N为子域数目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)