Verified65% confidenceFactExact time
The Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).
3
Sources
65%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
谱池化详解：从频域视角重新理解CNN下采样机制
Related Claims
UnverifiedNTT (Number Theoretic Transform) can reduce the complexity of polynomial multiplication from O(n²) to O(n log n).77% 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.76% similarUnverified直接在SO(3)上做卷积的朴素复杂度为O(B^6)，通过快速球面傅里叶变换（基于Driscoll-Healy或McEwen-Wiaux采样定理）可降低至O(B^5)甚至更低76% similarUnverified根据率失真理论，若序列包含O(N)比特相关信息而隐状态只有O(d)比特容量，当N远大于d时必然产生信息丢失75% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)75% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/715408API
curl https://kongchang.com/api/v1/knowledge/claims/715408MCP
get_claim(id=715408)