Unverified50% confidenceFactExact time
In 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).
1
Sources
50%
Confidence
Long-term
Relevance
9/22/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedDijkstra's algorithm was proposed by Dutch computer scientist Edsger Dijkstra in 1956, with a time complexity of O((V+E)logV).66% similarUnverified对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法64% similarVerifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.62% similarUnverifiedTarjan算法由Robert Tarjan于1972年提出，能在单次DFS中以O(V+E)找出有向图所有强连通分量59% similarVerifiedThe 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).56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/942005API
curl https://kongchang.com/api/v1/knowledge/claims/942005MCP
get_claim(id=942005)