73 search results - page 3 / 15 » On the Automatizability of Polynomial Calculus |
SIAMCOMP
2000
13 years 5 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
JCT
2006
13 years 5 months ago
2006
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
FOCS
1999
IEEE
13 years 10 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...
CONCUR
2003
Springer
13 years 11 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...