1199 search results - page 91 / 240 » Parameterized Proof Complexity |
ACL2
2006
ACM
14 years 4 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
FC
2010
Springer
14 years 1 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
ENTCS
2008
13 years 10 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
JCSS
2008
13 years 10 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...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...