1274 search results - page 48 / 255 » New Proofs for |
78
Voted
DCG
2008
15 years 20 days 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...
82
Voted
ASIAN
2004
Springer
15 years 6 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...
99
Voted
FOCS
2003
IEEE
15 years 5 months 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
15 years 17 days 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...
113
Voted
CCS
2008
ACM
15 years 2 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...