相关论文: One-step replica symmetry breaking of random regul…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…
The random $k$-SAT problem serves as a model that represents the 'typical' $k$-SAT instances. This model is thought to undergo a phase transition as the clause density changes, and it is believed that the random $k$-SAT problem is primarily…
Earlier we introduced the notion of a stable set of points (SSP). We proved that a CNF formula is unsatisfiable iff there is a set of points (i.e. complete assignments) that is stable with respect to this formula. Experiments showed that…
A constructive scheme for determining pure states (clusters) at very low temperature in the 3-spins glass model on a random lattice is provided, in full agreement with Parisi's one step replica symmetry breaking (RSB) scheme. Proof is based…
We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over~$\{\pm 1\}^n$. For each model $\mathcal{M}$, we identify the "high-probability value"~$s^*_{\mathcal{M}}$ of the…
To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state…
Spontaneous symmetry breaking occurs in a physical system whenever the ground state does not share the symmetry of the underlying theory, e.g., the Hamiltonian. It gives rise to massless Nambu-Goldstone modes and massive Anderson-Higgs…
Alongside the effort underway to build quantum computers, it is important to better understand which classes of problems they will find easy and which others even they will find intractable. We study random ensembles of the QMA$_1$-complete…
We study classical particles on the sites of an open chain which diffuse, coagulate and decoagulate preferentially in one direction. The master equation is expressed in terms of a spin one-half Hamiltonian $H$ and the model is shown to be…
The recent reports of the replica symmetry breaking (RSB) phenomenon in photonic experiments [1-5] boosted the understanding of the role of disorder in multimode lasers, as well as helped to settle enlightening connections [6-13] with the…
We analyze the density and size dependence of the relaxation time for kinetically constrained spin models (KCSM) intensively studied in the physical literature as simple models sharing some of the features of a glass transition. KCSM are…
We study the phase diagram of a one-dimensional spin quantum breakdown model, which has an exponential $U(1)$ symmetry with charge unit decaying as $2^{-j}$ with site position $j$. By exact diagonalization (ED), we show that the model with…
We present a study by computer simulations of a class of complex-valued solutions of the three-dimensional Navier-Stokes equations in the whole space, which, according to Li and Sinai, present a blow-up (singularity) at a finite time. The…
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…
Constraint satisfaction problems (CSPs) for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to…
The aim of this review paper is to give a panoramic of the impact of spin glass theory and statistical physics in the study of the K-sat problem. The introduction of spin glass theory in the study of the random K-sat problem has indeed left…
The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…