352 search results - page 31 / 71 » Proofs as Polynomials |
JCSS
2008
13 years 7 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
CORR
2000
Springer
13 years 7 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
PAIRING
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
FSTTCS
2005
Springer
14 years 28 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
COMBINATORICS
2006
13 years 7 months ago
2006
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof...