Unverified50% confidenceFactExact time
补偿求和算法（Kahan Summation Algorithm）于1965年提出，可将N个数求和的误差从O(N·ε)降低到O(ε)级别
1
Sources
50%
Confidence
Long-term
Relevance
8/12/2026
First Seen
Sources
固定随机种子GPU结果仍不可复现？深度解析原因与解决方案
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).63% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)63% similarUnverifiedOOSM 除回溯重放外还有 Algorithm A（用当前增益近似处理）和 Algorithm B（基于储存协方差进行精确后验修正）等方案，各有计算复杂度与精度权衡62% 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.61% 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.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/735647API
curl https://kongchang.com/api/v1/knowledge/claims/735647MCP
get_claim(id=735647)