Expired70% confidenceFactExact time
The Fast Fourier Transform (FFT) was proposed by Cooley and Tukey in 1965, reducing the computational complexity of the Discrete Fourier Transform from O(n²) to O(n log n).
4
Sources
70%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026(expired)
Sources
Related Claims
VerifiedShor's algorithm was proposed by Peter Shor in 1994 and can solve the integer factorization problem in O((log N)³) polynomial time complexity using the quantum Fourier transform.65% similarUnverifiedKen Perlin于2001年提出单纯形噪声，将计算复杂度从O(2^n)降至O(n^2)并消除方向性伪影62% similarUnverifiedIn 1984, Spencer, Szemerédi, and Trotter proved the upper bound result U(N) ≤ O(N^(4/3)), meaning the number of unit-distance pairs among N points does not exceed a constant multiple of N to the power of 4/3.58% similarUnverified线性注意力的数学基础源于2020年 Katharopoulos 等人发表于ICML的《Transformers are RNNs》，将时间复杂度从 O(N²) 降至 O(N)57% similarUnverified对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/46124API
curl https://kongchang.com/api/v1/knowledge/claims/46124MCP
get_claim(id=46124)