Unverified50% confidenceSolutionExact time
The importance sampling optimization idea can compress the actual algorithmic complexity from O(N) to O(k), where k is much smaller than N.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
Unverifiedk-partition probing reduces the computational overhead from O(n) to O(k), where k is much smaller than the sequence length n.79% similarUnverifiedA domain decomposition strategy can reduce the step complexity from O((L/w)²) to O(L²/(N·w²)), where N is the number of subdomains.78% similarUnverifiedSparse attention allows each query to interact with only k keys (where k is much smaller than n), reducing complexity to O(nk).77% similarUnverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升75% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks74% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1001220API
curl https://kongchang.com/api/v1/knowledge/claims/1001220MCP
get_claim(id=1001220)