Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I need to multiply several 1000s digits long integers as efficiently as possible in Python. The numbers are read from a file.
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.
Any help to understand this algorithm, like a practical example or some pseudo-code would be highly appreciated.
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.