相关论文: An exactly solvable random satisfiability problem

We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable if there exist two SAT assignments differing in Nx variables. We show the existence of a sharp…

The supersymmetric intertwining relations with second order supercharges allow to investigate new two-dimensional model which is not amenable to standard separation of variables. The corresponding potential being the two-dimensional…

This paper first analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it…

To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to each other. It is proved that under certain conditions, as r…

We consider "unconstrained" random $k$-XORSAT, which is a uniformly random system of $m$ linear non-homogeneous equations in $\mathbb{F}_2$ over $n$ variables, each equation containing $k \geq 3$ variables, and also consider a "constrained"…

We consider q-state Potts models coupled by their energy operators. Restricting our study to self-dual couplings, numerical simulations demonstrate the existence of non-trivial fixed points for 2 <= q <= 4. These fixed points were first…

The structural phase transitions and computational complexity of random 3-SAT instances are traditionally described using thermodynamic analogies from statistical physics, such as Replica Symmetry Breaking and energy landscapes. While…

We present a thorough analysis of the Non Intersecting String (NIS) model and its exact solution. This is an integrable $q$-states vertex model describing configurations of non-intersecting polygons on the lattice. The exact eigenvalues of…

In this paper we discuss a family of models of particle and energy diffusion on a one-dimensional lattice, related to those studied previously in [Sasamoto-Wadati], [Barraquand-Corwin] and [Povolotsky] in the context of KPZ universality…

It has been hypothesized that $k$-SAT is hard to solve for randomly chosen instances near the "critical threshold", where the clause-to-variable ratio is $2^k \ln 2-\theta(1)$. Feige's hypothesis for $k$-SAT says that for all sufficiently…

Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the…

We demonstrate a direct mapping of max k-SAT problems (and weighted max k-SAT) to a Chimera graph, which is the non-planar hardware graph of the devices built by D-Wave Systems Inc. We further show that this mapping can be used to map a…

We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $\alpha=\lim_{n\to\infty}m/n$ for $k=2,3$. It is known that if $\alpha$ is small enough, then the random $k$-SAT problem admits a solution with…

For abstract linear systems in Hilbert spaces we revisit the problems of exact controllability and complete stabilizability (stabilizability with an arbitrary decay rate), the latter property is equivalent to exact null controllability. We…

We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric…

A family of exactly solvable models describing a spin-S Heisenberg chain doped with mobile spin-(S-1/2) carriers is constructed from gl(2|1)-invariant solutions of the Yang-Baxter equation. The models are generalizations of the…

The search of hardware-compatible strategies for solving NP-hard combinatorial optimization problems (COPs) is an important challenge of today s computing research because of their wide range of applications in real world optimization…

Decision lists are one of the most easily explainable machine learning models. Given the renewed emphasis on explainable machine learning decisions, this machine learning model is increasingly attractive, combining small size and clear…

Corroborating a prediction from statistical physics, we prove that the Belief Propagation message passing algorithm approximates the partition function of the random $k$-SAT model well for all clause/variable densities and all inverse…

In this short paper we present a survey of some results concerning the random SAT problems. To elaborate, the Boolean Satisfiability (SAT) Problem refers to the problem of determining whether a given set of $m$ Boolean constraints over $n$…