Unverified50% confidenceFactExact time
k-partition probing reduces the computational overhead from O(n) to O(k), where k is much smaller than the sequence length n.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
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.71% similarUnverifiedIncremental Markdown parsing processes only newly added segments, reducing parsing overhead from O(n) to near O(1).69% similarUnverified根据率失真理论，若序列包含O(N)比特相关信息而隐状态只有O(d)比特容量，当N远大于d时必然产生信息丢失69% similarUnverifiedUkkonen 的对角线剪枝可将编辑距离计算的平均复杂度降至 O(k×min(m,n))，其中 k 为编辑距离阈值69% similarUnverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/986622API
curl https://kongchang.com/api/v1/knowledge/claims/986622MCP
get_claim(id=986622)