23 search results - page 3 / 5 » csr 2009 |
CSR
2009
Springer
14 years 2 months ago
2009
Springer
We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...
CSR
2009
Springer
13 years 8 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...