Random numbers are a fundamental resource in science and engineering with important
applications in simulation and cryptography. The inherent randomness at the core of …

This paper studies the problem of learning “low-complexity” probability distributions over the
Boolean hypercube {—1, 1} n. As in the standard PAC learning model, a learning problem in …

We study SET-DISJOINTNESS in a generalized model of randomized two-party
communication where the probability of acceptance must be at least α (n) on yes-inputs and …

We investigate the complexity of problems that admit perfect zero-knowledge interactive
protocols and establish new unconditional upper bounds and oracle separation results. We …

$\mathsf {StoqMA} $ captures the computational hardness of approximating the ground
energy of local Hamiltonians that do not suffer the so-called sign problem. We provide a …

We study set-disjointness in a generalized model of randomized two-party communication
where the probability of acceptance must be at least alpha (n) on yes-inputs and at most …

We prove nearly matching upper and lower bounds on the randomized communication
complexity of the following problem: Alice and Bob are each given a probability distribution …

The 18th Theory of Cryptography Conference (TCC 2020) was held virtually during
November 16–19, 2020. It was sponsored by the International Association for Cryptologic …

Random algorithms have a unique place in complexity theory as a model of computation
that ispotentially more powerful than “normal” algorithms, and is also practical. However, it is …

In the seminal work of 4, Babai has introduced Arthur-Merlin Protocols and in particular the
complexity classes MA and AM as randomized extensions of the class NP. While it is easy to …