352 search results - page 5 / 71 » Proofs as Polynomials |
ECCC
2010
13 years 6 months ago
2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
CRYPTO
1991
Springer
13 years 10 months ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
CSL
2002
Springer
13 years 6 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...