Related papers: An exactly solvable random satisfiability problem
Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers to solve. Building on a classical result of Alon and Shapira,…
The dynamical structure factor $S(q,\omega)$ of the SU(K) (K=2,3,4) Haldane-Shastry model is derived exactly at zero temperature for arbitrary size of the system. The result is interpreted in terms of free quasi-particles which are…
In quasi-exactly solvable problems partial analytic solution (energy spectrum and associated wavefunctions) are obtained if some potential parameters are assigned specific values. We introduce a new class in which exact solutions are…
We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the…
Boolean satisfiability [1] (k-SAT) is one of the most studied optimization problems, as an efficient (that is, polynomial-time) solution to k-SAT (for $k\geq 3$) implies efficient solutions to a large number of hard optimization problems…
Much of the recent work on random constraint satisfaction problems has been inspired by ingenious but non-rigorous approaches from physics. The physics predictions typically come in the form of distributional fixed point problems that are…
We introduce a highly structured family of hard satisfiable 3-SAT formulas corresponding to an ordered spin-glass model from statistical physics. This model has provably "glassy" behavior; that is, it has many local optima with large energy…
A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few…
The study of phase transition phenomenon of NP complete problems plays an important role in understanding the nature of hard problems. In this paper, we follow this line of research by considering the problem of counting solutions of…
Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value…
We introduce a novel quantum spin-glass model, a Sherrington-Kirkpatrick model with a transverse mean-field type random magnet. We rigorously derive the exact expression of the free energy of this model at the entire parameter region. The…
In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all…
Boolean Satisfiability (SAT) problems are critical in fields such as artificial intelligence and cryptography, where efficient solutions are essential. Conventional probabilistic solvers often encounter scalability issues due to complex…
A new exactly solvable one-dimensional spin-3/2 Heisenberg model with SO(5)-invariance is proposed. The eigenvalues and Bethe ansatz equations of the model are obtained by using the nested algebraic Bethe ansatz approach. Several exotic…
We obtain the exact scale invariant scattering solutions for two-dimensional field theories with replicated permutational symmetry $\mathbb{S}_q$. After sending to zero the number of replicas they correspond to the renormalization group…
This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear…
The nature of the interplay between fluctuations and quenched random disorder is a long-standing open problem, particularly in systems with a continuous order parameter. This lack of a full theoretical treatment has been underscored by…
We study the problem of satisfiability of randomly chosen clauses, each with K Boolean variables. Using the cavity method at zero temperature, we find the phase diagram for the K=3 case. We show the existence of an intermediate phase in the…
We study the metastable equilibrium properties of the Potts model with heat-bath transition rates using a novel expansion. The method is especially powerful for large number of state spin variables and it is notably accurate in a rather…