1401 search results - page 20 / 281 » Randomness in Interactive Proofs |
FUIN
2008
14 years 9 months ago
2008
A few years ago a nice criterion of Martin-L
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. State-of-the-art proof presentation systems suffer from several deficiencies. First, they simply present the proofs without motivating why the proof is done as it is do...
76
Voted
MICS
2008
14 years 9 months ago
2008
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...