Recent years witnessed the development of powerful generative models based on flows,
diffusion, or autoregressive neural networks, achieving remarkable success in generating …

The two central topics of information theory are the compression and the transmission of
data. Shannon, in his seminal work, formalized both these problems and determined their …

We consider lossy source compression of a binary symmetric source using polar codes and
a low-complexity successive encoding algorithm. It was recently shown by Arikan that polar …

For many random constraint satisfaction problems, by now there exist asymptotically tight
estimates of the largest constraint density for which solutions exist. At the same time, for …

Let Φ be a uniformly random k-SAT formula with n variables and m clauses. We study the
algorithmic task of finding a satisfying assignment of Φ. It is known that satisfying …

We consider Ising mixed $ p $-spin glasses at high-temperature and without external field,
and study the problem of sampling from the Gibbs distribution $\mu $ in polynomial time. We …

Resistance to targeted cancer therapies is an important clinical problem. The discovery of
anti-resistance drug combinations is challenging as resistance can arise by diverse escape …

Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique
for quantum error correction. A variety of decoders have been proposed for QLDPC codes …

This manuscript provides a comprehensive review of the Maximum Clique Problem, a
computational problem that involves finding subsets of vertices in a graph that are all …

Abstract Finding a Maximum Clique is a classic property test from graph theory; find any one
of the largest complete subgraphs in an Erdös-Rényi G (N, p) random graph. We use …