On Sat, May 15, 2010 at 12:55 PM, Tom Coates wrote:
>
> Thank you (everyone!) for the many extremely helpful comments and
> links.
>
> Recall that I need to compute
>
> 1, f, f^2, ..., f^K
>
> for f in ZZ[x,y,z] and K known but large. (In fact I only need
> certain coefficients of the f^i, but th
Hi Bill,
On Fri, May 14, 2010 at 3:28 PM, Bill Hart wrote:
> If I make a couple of simplifications, namely assume that the output
> fits into two limbs, and that none of the polynomials has length >
> 2^32 - 1, etc, I get pretty good times, certainly better than reported
> in Francesco's paper. I
Hi Bill,
in my own experience Kronecker substitution can be effective in a
number of situations. It would also automatically handle the case you
mention about working only on a subset of variables (i.e., the ones
involved in the multiplication).
I have the description of my implementation and som
