Events and Activities

A common tool in the construction of probabilistically checkable proofs is low degree encodings. Babai, Fortnow and Lund proved the local testability of the individual low degree code, and used it to provide a multi-prover interactive proof (MIP)...

An important open problem is to classify rational points on all modular curves, or equivalently to classify the possible adelic Galois images of elliptic curves over Q, as envisioned in Mazur’s Program B. However, this problem is inherently infinite...

In the “Origin of Species” Charles Darwin established the scientific basis for understanding how evolution occurs by natural selection. To explain how new species form he envisioned a three-step process involving colonization of a new area...

The shuffle model is a widely used abstraction for non-interactive anonymous communication. It allows $n$ parties holding private inputs $x_1,\dots,x_n$ to simultaneously send messages to an evaluator, so that the messages are received in a random...

In the noisy $k$-XOR problem, one is given $y \in \bF_2^\constraints$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with variables and constraints, $x\in \bF_2^...