Unverified50% confidenceFactExact time
Ukkonen 的对角线剪枝可将编辑距离计算的平均复杂度降至 O(k×min(m,n))，其中 k 为编辑距离阈值
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
UnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.69% similarUnverifiedThe 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).67% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks66% similarUnverified对于长度为 n 的查询词和编辑距离 k，Levenshtein 自动机的状态数约为 O(n×(2k+1)^k)，随 k 增大呈指数级上升65% 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.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/731172API
curl https://kongchang.com/api/v1/knowledge/claims/731172MCP
get_claim(id=731172)