Many questions of fundamental interest in today's science can be formulated as inference
problems: some partial, or noisy, observations are performed over a set of variables and the …

The availability of quantum annealing devices with hundreds of qubits has made the
experimental demonstration of a quantum speedup for optimization problems a coveted …

With current semiconductor technology reaching its physical limits, special-purpose
hardware has emerged as an option to tackle specific computing-intensive challenges …

In this paper, we show that the models of random CSP instances proposed by Xu and Li [K.
Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of …

The problem of identifying a planted assignment given a random k-SAT formula consistent
with the assignment exhibits a large algorithmic gap: while the planted solution can always …

Quantum annealing provides a promising route for the development of quantum optimization
devices, but the usefulness of such devices will be limited in part by the range of …

We study constraint satisfaction problems on the so-called planted random ensemble. We
show that for a certain class of problems, eg, graph coloring, many of the properties of the …

We present an efficient algorithm to solve semirandom planted instances of any Boolean
constraint satisfaction problem (CSP). The semirandom model is a hybrid between worst …

Boolean satisfiability is a propositional logic problem of interest in multiple fields, eg,
physics, mathematics, and computer science. Beyond a field of research, instances of the …

Many inference problems undergo phase transitions as a function of the signal-to-noise
ratio, a prominent example of this phenomenon being found in the stochastic block model …