Unverified50% confidenceFactExact time
Ken Perlin于2001年提出单纯形噪声，将计算复杂度从O(2^n)降至O(n^2)并消除方向性伪影
1
Sources
50%
Confidence
Long-term
Relevance
7/17/2026
First Seen
Sources
Related Claims
VerifiedThe 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).62% similarUnverified线性注意力的数学基础源于2020年 Katharopoulos 等人发表于ICML的《Transformers are RNNs》，将时间复杂度从 O(N²) 降至 O(N)61% similarUnverified指针分析经典算法中，Andersen 分析精度更高但计算复杂度达 O(n³)，Steensgaard 分析近乎线性但精度较低57% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代57% similarUnverifiedThe computational complexity of DFT typically scales as the cube of the number of atoms N (O(N³)).56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/547601API
curl https://kongchang.com/api/v1/knowledge/claims/547601MCP
get_claim(id=547601)