Unverified50% confidenceFactExact time
Toom-Cook and the FFT-based Schönhage-Strassen algorithm further approach n log n.
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Schönhage–Strassen algorithm transforms integer multiplication into polynomial multiplication, then uses the FFT to efficiently perform convolution in the frequency domain.70% similarUnverifiedFFT can convert a polynomial from coefficient representation to point-value representation in O(n log n) time.68% similarUnverified对于超大规模图谱，基于 Barnes-Hut 算法可实现 O(N log N) 近似力计算以优化性能68% similarUnverified传统线性时不变SSM（如S4模型）系统矩阵A、B、C在序列处理中保持不变，递推关系可展开为卷积形式，利用FFT在O(N log N)时间内并行计算62% similarUnverifiedThe project efficiently computes the history vector P_t via zero-padded FFT linear convolution, keeping overall complexity at O(T log T).59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1014148API
curl https://kongchang.com/api/v1/knowledge/claims/1014148MCP
get_claim(id=1014148)