Unverified50% confidenceFactExact time
In 1971, Schönhage and Strassen introduced the fast Fourier transform (FFT), pushing the complexity of integer multiplication down to O(n log n log log n).
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn 1987, Fredman and Tarjan proposed the Fibonacci heap, reducing the complexity of Dijkstra's algorithm to the more precise form of O(m + n log n).61% similarVerifiedShor'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.56% similarUnverified对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法55% similarUnverifiedHarvey and van der Hoeven proposed an O(n log n) integer multiplication algorithm, which is considered to be asymptotically near-optimal.53% similarUnverified多数业余大数构造在经过仔细分析后，往往落在FGH的f_ω到f_{ω^ω}之间，而非作者声称的'超越一切已知界限'53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1014151API
curl https://kongchang.com/api/v1/knowledge/claims/1014151MCP
get_claim(id=1014151)