Related papers: An exactly solvable random satisfiability problem
Form a random k-SAT formula on n variables by selecting uniformly and independently m=rn clauses out of all 2^k (n choose k) possible k-clauses. The Satisfiability Threshold Conjecture asserts that for each k there exists a constant r_k…
The Boolean Satisfiability (SAT) problem stands out as an attractive NP-complete problem in theoretic computer science and plays a central role in a broad spectrum of computing-related applications. Exploiting and tuning SAT solvers under…
The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random $k$-SAT, nonrigorous methods from Statistical Physics support the validity of the ``one step replica…
We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the…
Satisfiability is considered the canonical NP-complete problem and is used as a starting point for hardness reductions in theory, while in practice heuristic SAT solving algorithms can solve large-scale industrial SAT instances very…
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular, when the maximum clause length is 3, this model displays a…
We deform the real potential of Poeschl and Teller by a shift of its coordinate in imaginary direction. We show that the new model remains exactly solvable. Its bound states are constructed in closed form. Wave functions are complex and…
We construct a variety of new exactly-solvable quantum systems, the potentials of which are given in terms of Lambert-W functions. In particular, we generate Schr\"odinger models with energy-dependent potentials, conventional Schr\"odinger…
We provide a comprehensive view of various phase transitions in random $K$-satisfiability problems solved by stochastic-local-search algorithms. In particular, we focus on the finite-size scaling (FSS) exponent, which is mathematically…
We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial "core" assignments. Core assignments are certain partial…
We introduce the fermionic satisfiability problem, Fermionic $k$-SAT: this is the problem of deciding whether there is a fermionic state in the null-space of a collection of fermionic, parity-conserving, projectors on $n$ fermionic modes,…
Motivated by recent experiments on twisted junctions of cuprate superconductors (SC), it was proposed [1] that at zero temperature, a random first order Josephson coupling $J_1(\textbf{r}) \cos \phi$ generates an "effective" global second…
In this paper we translate Talagrand's solution of the K-sat model at high temperature into the language of asymptotic Gibbs measures. Using exact cavity equations in the infinite volume limit allows us to remove many technicalities of the…
A mean field spherical model with random couplings between pairs, quartets, and possibly higher multiplets of spins is considered. It has the same critical behavior as the Sherrington-Kirkpatrick model. It thus exhibits replica symmetry…
We consider the K-satisfiability problem on a regular d-ary rooted tree. For this model, we demonstrate how we can calculate in closed form, the moments of the total number of solutions as a function of d and K, where the average is over…
A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying…
We compute the thermodynamic properties of the 3-satisfiability problem in the infinite connectivity limit. In this limit the computations can be strongly simplified and the thermodynamical properties can be obtained with an high accuracy.…
We review recent results on an exactly solvable model of nonequilibrium statistical mechanics, specifically the classical Rule 54 reversible cellular automaton and some of its quantum extensions. We discuss the exact microscopic description…
A one-dimensional dissipative Hubbard model with two-body loss is shown to be exactly solvable. We obtain an exact eigenspectrum of a Liouvillian superoperator by employing a non-Hermitian extension of the Bethe-ansatz method. We find…
A new family of exactly solvable models is introduced. These models are generalizations of the XXZ chain where the distance among spins up ($\sigma^z$-basis) cannot be smaller or equal to t (t=0,1,2,...). The case t=0 recovers the standard…