Faster polynomial multiplication via multipoint Kronecker substitution

Details Faster polynomial multiplication via multipoint Kronecker substitution Faster polynomial multiplication via multipoint Kronecker substitution

2007-12-25

arxiv.org/abs/0712.4046v1

Computer Science

Symbolic Computation

14 pages, 4 figures

Scientific paper

We give several new algorithms for dense polynomial multiplication based on
the Kronecker substitution method. For moderately sized input polynomials, the
new algorithms improve on the performance of the standard Kronecker
substitution by a sizeable constant, both in theory and in empirical tests.

Affiliated with

Also associated with

No associations

Rating

Faster polynomial multiplication via multipoint Kronecker substitution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster polynomial multiplication via multipoint Kronecker substitution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster polynomial multiplication via multipoint Kronecker substitution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-184843