On the bit-complexity of sparse polynomial multiplication

Details On the bit-complexity of sparse polynomial multiplication On the bit-complexity of sparse polynomial multiplication

2009-01-26

arxiv.org/abs/0901.4323v1

Computer Science

Data Structures and Algorithms

Scientific paper

In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity results for the power series multiplication in many variables. Our algorithms are implemented and freely available within the Mathemagix software. We show that their theoretical costs are well-reflected in practice.

Affiliated with

Also associated with

No associations

Rating

On the bit-complexity of sparse polynomial multiplication 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 On the bit-complexity of sparse polynomial multiplication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the bit-complexity of sparse polynomial multiplication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362552