Subject: Re: [boost] [math] Efficient polynomial multiplication
From: Alexander Zaitsev (zamazan4ik_at_[hidden])
Date: 2017-07-13 08:42:13
At first please give us bencmark results, where NlogN is faster and
where is slower.
After that please write email to Boost.Math maintainer or create issue
on Github Boost.Math repo.
13.07.2017 08:00, Lakshay Garg via Boost Ð¿Ð¸ÑÐµÑ:
> Hello all
> This is my first post to the mailing list.
> While looking at the source code for polynomial multiplication
> (boost/math/tools/polynomial.hpp) I discovered that the library used
> O(N^2) algorithm for multiplication. I would like to work on
> implementing a more efficient algorithm (complexity: O(N log(N))).
> I am writing this mail to get views and feedback from the community
> and have a healthy discussion before starting the work.
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk