9 search results - page 2 / 2 » Arithmetic Circuits and the Hadamard Product of Polynomials |
ECCC
2011
13 years 7 days ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
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...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...