Boost logo

Boost :

Subject: [boost] [math] Efficient polynomial multiplication
From: Lakshay Garg (lakshayg373_at_[hidden])
Date: 2017-07-13 05:00:04

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.


Boost list run by bdawes at, gregod at, cpdaniel at, john at