We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Overlapping batch statistics estimate the variance of point estimators using overlapping batches (Schmeiser, Avramidis and Hashem 1990). In this paper we study sufficient conditio...
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...