Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Testing Equivalence to the Hamiltonian Cycle Polynomial
Agrim Dewan
The Hamiltonian Cycle polynomial, denoted as , is defined to be the sum of the weighted Hamiltonian Cycles in an -vertex complete digraph, with vertices labeled to …
cs.CC2024
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
Omkar Baraskar, Agrim Dewan, Chandan Saha +1
An -sparse polynomial has at most monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial…