182 search results - page 4 / 37 » The Proof Complexity of Polynomial Identities |
ECCC
2007
13 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
FSTTCS
2009
Springer
14 years 4 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...
MST
2010
13 years 8 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...