Unverified50% confidenceFactExact time
The multi-scale FFT algorithm reduces the runtime's dependence on α from O(α^{-2}) to O(α^{-1} log(1/α)).
1
Sources
50%
Confidence
Long-term
Relevance
11/2/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Schönhage–Strassen algorithm leverages the Fast Fourier Transform (FFT) to reduce integer multiplication complexity to O(n log n log log n).68% similarUnverifiedThe new algorithm achieves a strict exponential speedup on several instance classes, reducing the total running time to O*(2^{(1-γ)n}), where γ>0 is a fixed constant.66% similarUnverifiedThe algorithm's time complexity is log(1/ε)^{O(log^2 d)}, where d is the dimension and ε is the approximation accuracy.66% similarUnverifiedHNSW算法的时间复杂度约为O(log N)，近似最近邻算法在召回率95-99%下将检索时间从线性降至对数级别65% similarUnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1125650API
curl https://kongchang.com/api/v1/knowledge/claims/1125650MCP
get_claim(id=1125650)