Unverified50% confidenceFactExact time
Shor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)
1
Sources
50%
Confidence
Long-term
Relevance
8/4/2026
First Seen
Sources
Related Claims
Unverified快速傅里叶变换将DFT的计算复杂度从朴素的O(N²)降低到O(N log N)75% similarUnverifiedNTT（数论变换）能将多项式乘法的复杂度从 O(n²) 降至 O(n log n)75% similarUnverifiedDouglas-Peucker算法通过迭代去除偏离度小于阈值的中间点来简化折线，时间复杂度为O(n log n)74% similarUnverified分解子域策略可将步数复杂度从O((L/w)²)降低到O(L²/(N·w²))，其中N为子域数目72% similarUnverified经典LLL算法在使用精确有理数运算时中间有理数位长最坏可达O(n·β)级别，整体复杂度达到O(n⁵·β³)甚至更高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)