STOC

Orthogonal arrays are a type of combinatorial design that emerged in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of minimum size. ...

The Tree Evaluation Problem (TreeEval) (Cook et al. 2009) is a central candidate for separating polynomial time (P) from logarithmic space (L) via composition. While space lower bounds of Ω(log² n) are known for multiple restricted models, it was ...

Spurred by the influential work of Viola (Journal of Computing 2012), the past decade has witnessed an active line of research into the complexity of (approximately) sampling distributions, in contrast to the traditional focus on the complexity of ...

We prove that the class of communication problems with public-coin randomized constant-cost protocols, called BPP⁰, does not contain a complete problem. In other words, there is no randomized constant-cost problem Q ∈ BPP⁰, such that all other problems P ...

We study the power of randomness in the Number-on-Forehead (NOF) model in communication complexity. We construct an explicit 3-player function f:[N]³ → {0,1}, such that: (i) there exist a randomized NOF protocol computing it that sends a constant number ...