Unverified50% confidenceFactExact time
New shortest path algorithms have proven that the SSSP problem can be solved in complexity below O(m + n log n) under specific graph models.
1
Sources
50%
Confidence
Long-term
Relevance
9/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).70% similarUnverifiedOn the algorithm engineering task (Lasso path solver), Dream-RSI reduces the number of agent calls by 162× compared to baselines such as SimpleTES while still outperforming standard library implementations.69% similarUnverifiedWhen using exact rational arithmetic, the bit length of intermediate rational numbers in the classical LLL algorithm can reach O(n·β) in the worst case, with an overall complexity of O(n⁵·β³) or even higher.68% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).67% similarVerifiedHNSW reduces search complexity to approximately O(log n) by constructing a multi-layer graph index, while IVF partitions the vector space via K-means clustering to achieve orders-of-magnitude speed improvements at the cost of approximately 5–10% recall.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/942009API
curl https://kongchang.com/api/v1/knowledge/claims/942009MCP
get_claim(id=942009)