NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials

Omkar Baraskar, Agrim Dewan, Chandan Saha +1

An $s$-sparse polynomial has at most $s$ monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…