On 13 mai, 19:03, Roman Pearce <rpear...@gmail.com> wrote: > On May 13, 2:45 am, parisse <bernard.pari...@ujf-grenoble.fr> wrote: > > > In my own experience, coding with an univariate polynomial is not > > efficient especially if the polynomial is sparse. > > There must be some kind of inefficiency. If you use word > operations > for all monomial operations then it should be fast. > Seehttp://portal.acm.org/citation.cfm?id=281657 >
Sorry, I made a confusion. I wanted to say that multiplying using big integers was inefficient. I'm of course using univariate multiplication by packing monomials in an integer (if it can fit). Looking at Biscani's paper, it seems he has good timing by preallocating an array for the resulting monomial in the "semi-dense" case (by semi-dense I mean dense with respect to total degree). -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
