julia PolynomialSparse
The current implementation for polynomials is a vector where the term of degree k is stored at position k + 1. This is good for dense polynomials (those with mostly nonzero coefficients) but our factoring algorithms rely heavily on manipulating sparse polynomials like a” – 1. Therefore, • Create a new type called PolynomialSparse that …