1274 search results - page 48 / 255 » New Proofs for |
DCG
2008
13 years 7 months ago
2008
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
ASIAN
2004
Springer
14 years 1 months ago
2004
Springer
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
JETAI
2008
13 years 7 months ago
2008
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
This paper presents the first type system for statically analyzing security protocols that are based on zero-knowledge proofs. We show how several properties offered by zero-knowl...