“The best complexity these days [1] is essentially n log n. More precisely, O( n log n 8^(log* n) ), where log* is the extremely slow-growing iterated logarithm. The original Schönhage-Strassen algorithm is O(n log n log log n). [1] http://arxiv.org/abs/1407.3360”
按年被提到
20142014 · 1 次2026
Even faster integer multiplication
David Harvey, Joris van der Hoeven, Grégoire Lecerf · 2014
被提及 · 2 人首次 2014-07-15 · 最近 2015-09-07
2不同的人
2活跃月份
2讨论串
94被引(OpenAlex)
arXiv 摘要(候选层不写导读)
We give a new proof of Fürer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike Fürer, our method does not require constructing special coefficient rings with "fast" roots of unity. Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8. We show that an optimised variant of Fürer's algorithm achieves only K = 16, suggesting that the new algorithm is faster than Fürer's by a factor of 2^(log^* n). Assuming standard conjectures about the distribution of Mersenne primes, we give yet another algorithm that achieves K = 4.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及评论pbsd · 2015-09
被提交为 story · 1 次
- Even faster integer multiplication ↗fdej · 2014-07-15 · 94 分