5084 search results - page 226 / 1017 » Proving Possibility Properties |
172
click to vote
COLT
2007
Springer
16 years 21 days ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
182
click to vote
PROVSEC
2007
Springer
16 years 19 days ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
198
click to vote
CSL
2005
Springer
16 years 2 days ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
173
click to vote
FCT
2005
Springer
16 years 1 days ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
190
click to vote
INDOCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...