1401 search results - page 48 / 281 » Randomness in Interactive Proofs |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
TYPES
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
105
click to vote
FSTTCS
1991
Springer
15 years 1 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We establish the restricted isometry property for finite dimensional Gabor systems, that is, for families of time–frequency shifts of a randomly chosen window function. We show...