On 25 April 2018 at 21:39, Tanushree Banerjee <
banerjee.tanushre...@gmail.com> wrote:
> I see. I know that standard Schoenhage-Strassen algorithm. has the
> complexity of O(n. log(n). log(log(n)), this algorithm also has the same
> complexity then?
>
Yes.
>
> I was confused as in the GMP and MPIR documents, it was mentioned that FFT
> based multiplication will have O(n^{k/(k-2)}) complexity
>
What is k?
--
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.
