96 search results - page 12 / 20 » On Several Proofs of the Recognizability Theorem |
ECCC
2000
14 years 9 months ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
FAC
2008
14 years 9 months ago
2008
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
CADE
2012
Springer
13 years 2 hour ago
2012
Springer
We propose a new logic, called differential dynamic game logic (dDGL), that adds several game constructs on top of differential dynamic logic (dL) so that it can be used for hybr...
111
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...