We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...