Unverified50% confidenceFactExact time
Harvey and van der Hoeven proposed an O(n log n) integer multiplication algorithm, which is considered to be asymptotically near-optimal.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
Unverified对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法68% similarVerifiedThe Hungarian algorithm was developed by Harold Kuhn in 1955 based on the work of Dénes Kőnig and Jenő Egerváry, has a time complexity of O(n³), and is used for optimal assignment in bipartite graphs.61% similarUnverifiedEM 算法由 Dempster、Laird 和 Rubin 于 1977 年正式提出，通过交替执行 E 步和 M 步迭代优化，保证每步都不降低似然函数值60% similarUnverified2010年Larry Guth和Nets Katz利用多项式方法解决了Erdős距离问题，证明n个点至少确定Ω(n/log n)个不同距离60% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/982665API
curl https://kongchang.com/api/v1/knowledge/claims/982665MCP
get_claim(id=982665)