2 papers
cs.CC2025
Negations are powerful even in small depth
Bruno Cavalar, Théo Borém Fabris, Partha Mukhopadhyay +2
We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials in variables, all of whose mon…
cs.CC2025
Efficient Polynomial Identity Testing Over Nonassociative Algebras
Partha Mukhopadhyay, C Ramya, Pratik Shastri
We design the first efficient polynomial identity testing algorithms over the nonassociative polynomial algebra. In particular, multiplication among the formal variables is commuta…