3 search results - page 1 / 1 » Monomials in Arithmetic Circuits: Complete Problems in the C... |
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
CORR
2007
Springer
13 years 4 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...