Unverified50% confidenceFactExact time
直接在SO(3)上做卷积的朴素复杂度为O(B^6)，通过快速球面傅里叶变换（基于Driscoll-Healy或McEwen-Wiaux采样定理）可降低至O(B^5)甚至更低
1
Sources
50%
Confidence
Long-term
Relevance
8/20/2026
First Seen
Sources
Related Claims
UnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).76% 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.74% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)68% similarUnverifiedWhen using exact rational arithmetic, the bit length of intermediate rational numbers in the classical LLL algorithm can reach O(n·β) in the worst case, with an overall complexity of O(n⁵·β³) or even higher.66% similarUnverified根据率失真理论，若序列包含O(N)比特相关信息而隐状态只有O(d)比特容量，当N远大于d时必然产生信息丢失66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/778925API
curl https://kongchang.com/api/v1/knowledge/claims/778925MCP
get_claim(id=778925)