了解Schönhage-Strassen的算法（巨大的整数倍） [英] Understanding Schönhage-Strassen algorithm (huge integer multiplication)

问题描述

我要乘数1000位长整数尽可能有效地在Python。从文件中读出的数字。

I need to multiply several 1000s digits long integers as efficiently as possible in Python. The numbers are read from a file.

我想实现的Schönhage-Strassen的算法整数乘法，但我停留在理解的定义和数学的背后，特别是快速傅立叶变换。

I am trying to implement the Schönhage-Strassen algorithm for integer multiplication, but I am stuck on understanding the definition and mathematics behind it, specially the Fast Fourier Transform.

任何帮助理解这个算法，像一个实际的例子还是有些假code将是非常美联社preciated。

Any help to understand this algorithm, like a practical example or some pseudo-code would be highly appreciated.

推荐答案

Knuth的的 TAOCP 的描述它，并且还具有一些FFT伪$ C $中的c，可以被用于这个其他章节。

Chapter 4.3.3 of Knuth's TAOCP describes it and also has some FFT pseudocode in other chapters that could be used for this.

这篇关于了解Schönhage-Strassen的算法（巨大的整数倍）的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！