Add non-regression test for polynomial primitives
We now have efficient polynomial primitives, like multiplication, division, composition, gcd, interpolation, etc.
It would be nice that their promised complexity be documented and tested for.
We now have efficient polynomial primitives, like multiplication, division, composition, gcd, interpolation, etc.
It would be nice that their promised complexity be documented and tested for.