Related papers: An exactly solvable random satisfiability problem
We consider a "configuration model" for random XORSAT which is a random system of $n$ equations over $m$ variables in $\mathbb F_2$. Each equation is of the form $y_1 + y_2 + \cdots + y_k = b$ where $k \geq 3$ is fixed, $y_1, y_2, \cdots$…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
We study $q$-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein, given a sequence of $q$-CNF fomulas and a non-negative integer $d$, the question is whether there is a sequence of satisfying truth assignments…
The (2+p)-Satisfiability (SAT) problem interpolates between different classes of complexity theory and is believed to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a…
We propose a generic construction of exactly soluble \emph{local bosonic models} that realize various topological orders with gappable boundaries. In particular, we construct an exactly soluble bosonic model that realizes a 3+1D $Z_2$ gauge…
First, an algebraic criterion for integrability is discussed -the so-called `superintegrability'- and some results on the classification of superintegrable quantum spin Hamiltonians based on sl(2) are obtained. Next, the massive phases of…
We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring $S$, of which the…
We investigate variational problems in quantum thermodynamics at positive temperature, in which admissible states are constrained by prescribed outcomes of a finite set of measurements. We solve a problem raised by the recent work [Liu,…
We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the…
We construct a hierarchy of exactly solvable spin-1/2 chains with so(N)_1 critical points. Our construction is based on the framework of condensate-induced transitions between topological phases. We employ this framework to construct a…
We analyse a spin-1/2 chain with two-spin interactions which shown to exactly solvable by Lieb, Schultz and Mattis. We show that the model can be viewed as a generalised Kitaev model that is analytically solvable for all defect sectors. We…
The space of solutions of the exact renormalization group fixed point equations of the two-dimensional $RP^{N-1}$ model, which we recently obtained within the scale invariant scattering framework, is explored for continuous values of $N\geq…
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…
The satisfiability problem is known to be $\mathbf{NP}$-complete in general and for many restricted cases. One way to restrict instances of $k$-SAT is to limit the number of times a variable can be occurred. It was shown that for an…
We establish quantum and classical exact solvability for two large classes of maximally superintegrable Benenti systems in $n$ dimensions with arbitrarily large $n$. Namely, we solve the Hamilton--Jacobi and Schr\"odinger equations for the…
The Exact Satisfiability problem, XSAT, is defined as the problem of finding a satisfying assignment to a formula $\varphi$ in CNF such that exactly one literal in each clause is assigned to be "1" and the other literals in the same clause…
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge SAT instances. We thus present a technique to declaratively…
A special family of solvable five-vertex model is introduced on a square lattice. In addition to the usual nearest neighbor interactions, the vertices defining the model also interact alongone of the diagonals of the lattice. Such family of…
We propose the notion of $E_{2}$-quasi-exact solvability and apply this idea to find explicit solutions to the eigenvalue problem for a non-Hermitian Hamiltonian system depending on two parameters. The model considered reduces to the…