1401 search results - page 39 / 281 » Randomness in Interactive Proofs |
62
Voted
TCS
2002
14 years 9 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
104
click to vote
TPHOL
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Since the formalization of ring signature by Rivest, Shamir and Tauman in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the ra...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We study the effect of randomness in the adversarial queueing model. All proofs of instability for deterministic queueing strategies exploit a finespun strategy of insert...