Unverified50% confidenceFactExact time
Shor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
NIST后量子加密标准解读：应对量子计算威胁的迁移指南
Related Claims
UnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).75% similarUnverifiedNTT (Number Theoretic Transform) can reduce the complexity of polynomial multiplication from O(n²) to O(n log n).75% 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).74% 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.72% 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.71% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/680947API
curl https://kongchang.com/api/v1/knowledge/claims/680947MCP
get_claim(id=680947)