Related papers: Hiding Quiet Solutions in Random Constraint Satisf…
Recent studies of concentrated solid solutions have highlighted the role of varied solute interactions in the determination of a wide variety of mesoscale properties. These solute interactions emerge as spatial fluctuations in potential…
Diluted mean-field models are graphical models in which the geometry of interactions is determined by a sparse random graph or hypergraph. Based on a nonrigorous but analytic approach called the "cavity method", physicists have predicted…
We study the quantum version of a simplified model of optimization problems, where quantum fluctuations are introduced by a transverse field acting on the qubits. We find a complex low-energy spectrum of the quantum Hamiltonian,…
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level…
In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…
We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open boundaries is solved either exactly or with a heuristic, and then…
Topological phenomena are commonly studied in phases of matter which are separated from a trivial phase by an unavoidable quantum phase transition. This can be overly restrictive, leaving out scenarios of practical relevance -- similar to…
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…
Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all…
We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…
Recently, there is interest in coincident 'sharpening' and 'learnability' transitions in monitored quantum systems. In the latter, an outside observer's ability to infer properties of a quantum system from measurements undergoes a phase…
For many random Constraint Satisfaction Problems, by now, we have asymptotically tight estimates of the largest constraint density for which they have solutions. At the same time, all known polynomial-time algorithms for many of these…
The formation of self-organized patterns and localized states are ubiquitous in Nature. Localized states containing trivial symmetries such as stripes, hexagons, or squares have been profusely studied. Disordered patterns with non-trivial…
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…
We discuss a resource-competition model, which takes the MacArthur's model as a platform, to unveil interesting connections with glassy features and jamming in high dimension. This model presents two qualitatively different phases: a…
In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the…
We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in…
In graph coloring problems, the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic graph coloring, the goal is to minimize the…
Jamming is a common feature of out of equilibrium systems showing slow relaxation dynamics. Here we review our efforts in understanding jamming in granular materials using experiments and computer simulations. We first obtain an estimation…