Chandan Saha

collaborators

2 papers

cs.CC2026

Learning Read-Once Determinants and the Principal Minor Assignment Problem

Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh +3

A symbolic determinant under rank-one restriction computes a polynomial of the form $det (A_{0} + A_{1} y_{1} + \dots + A_{n} y_{n})$ , where $A_{0}, A_{1}, \dots, A_{n}$ are square matrices over a field $\…

cs.CC2024

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…