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
Unverified快速傅里叶变换将DFT的计算复杂度从朴素的O(N²)降低到O(N log N)76% similarUnverified分解子域策略可将步数复杂度从O((L/w)²)降低到O(L²/(N·w²))，其中N为子域数目74% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)68% similarUnverified经典LLL算法在使用精确有理数运算时中间有理数位长最坏可达O(n·β)级别，整体复杂度达到O(n⁵·β³)甚至更高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)