rp21a

2 ms·

1. 1.▲
   by rp21a 11y ago

   The first benchmark is dense up to the total degree and the staircase structure is bad for Kronecker substitution. The fastest method is probably sparse polynomial interpolation.
2. 2.▲
   by rp21a 11y ago

   For that CPU the times are good. My understanding is that Pari uses recursive dense, and Nemo is also using that, and you are instructing Magma to do that. I'll have to download Nemo and try it out :)
3. 3.▲
   by rp21a 11y ago

   I'd like to know the CPU to compare. For example, the first one is 5 seconds on a Core i5 4570 3.2 GHz in Maple. The second problem is also not clear. Is there a Kronecker substitution on the input? If so, what are the degrees? I&#