On 25 April 2018 at 19:35, Tanushree Banerjee < banerjee.tanushre...@gmail.com> wrote:
> Thanks @Bill Hart . I was going through the second link. So what is the > complexity of this algorithm ? > It's the same complexity as the standard Schoenhage-Strassen algorithm. > (I have a jpeg file attached with FFT multiplication algorithm snapshot, I > think this is not used in the mpir implementation, isnt it? ) > The algorithm used in MPIR is much more sophisticated. It would not be easy to write in pseudocode and I would not like to attempt it. -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to mpir-devel+unsubscr...@googlegroups.com. To post to this group, send email to mpir-devel@googlegroups.com. Visit this group at https://groups.google.com/group/mpir-devel. For more options, visit https://groups.google.com/d/optout.
