Unverified50% confidenceFactExact time
对于二维中由n个离散点构成的两组点集，Lo和Steiger于1990年给出了O(n log n)时间复杂度的确定性算法
1
Sources
50%
Confidence
Long-term
Relevance
8/23/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedBitap算法由Ricardo Baeza-Yates和Gaston Gonnet于1992年提出，时间复杂度为O(mn/w)65% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代64% similarUnverifiedShor'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.63% similarUnverified2010年Larry Guth和Nets Katz利用多项式方法解决了Erdős距离问题，证明n个点至少确定Ω(n/log n)个不同距离63% 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.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/791299API
curl https://kongchang.com/api/v1/knowledge/claims/791299MCP
get_claim(id=791299)