Related papers: Phase Transition in Unrestricted Random SAT

We study incompressible systems of motile particles with alignment interactions. Unlike their compressible counterparts, in which the order-disorder (i.e., moving to static) transition, tuned by either noise or number density, is…

We present an improvement on Thurley's recent randomized approximation scheme for #k-SAT where the task is to count the number of satisfying truth assignments of a Boolean function {\Phi} given as an n-variable k-CNF. We introduce a novel…

We employ uncertain parametric CTMCs with parametric transition rates and a prior on the parameter values. The prior encodes uncertainty about the actual transition rates, while the parameters allow dependencies between transition rates.…

In this Letter, three physical predictions on the phase separation of binary systems are derived based on a dynamic transition theory developed recently by the authors. First, the order of phase transitions is precisely determined by the…

The purpose of the present study is to search one-dimensional Cellular Automata (CA) rules which will solve the density classification task (DCT) perfectly. The mathematical analysis of number conserving functions over binary strings of…

This paper shows that the logarithm of the number of solutions of a random planted $k$-SAT formula concentrates around a deterministic $n$-independent threshold. Specifically, if $F^*_{k}(\alpha,n)$ is a random $k$-SAT formula on $n$…

Let F be a CNF formula with n variables and m clauses. F is 3-satisfiable if for any 3 clauses in F, there is a truth assignment which satisfies all of them. Lieberherr and Specker (1982) and, later, Yannakakis (1994) proved that in each…

We examine which first order phase transitions are consistent with today's astrophysical constraints. In particular, we explore how a well-constrained mass-radius data point would restrict the admissible parameter space and to this end, we…

We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines…

A one dimensional stochastic exclusion process with two species of particles, $+$ and $-$, is studied where density of each species can fluctuate but the total particle density is conserved. From the exact stationary state weights we show…

We study the behavior of ASAT, a heuristic for solving satisfiability problems by stochastic local search near the SAT/UNSAT transition. The heuristic is focused, i.e. only variables in unsatisfied clauses are updated in each step, and is…

The notion of (auto) catalytic networks has become a cornerstone in understanding the possibility of a sudden dramatic increase of diversity in biological evolution as well as in the evolution of social and economical systems. Here we study…

In this paper we establish a mathematically rigorous connection between Causal inference (C-inf) and the low-rank recovery (LRR). Using Random Duality Theory (RDT) concepts developed in [46,48,50] and novel mathematical strategies related…

We explicitly give a frame of cardinality $5n-6$ such that every signal in $\mathbb{C}^n$ can be recovered up to a phase from its associated intensity measurements via the PhaseLift approach. Furthermore, we give explicit linear…

We investigate the phase transition in a non-planar correlated percolation model with long-range dependence, obtained by considering level sets of a Gaussian free field with mass above a given height $h$. The dependence present in the model…

QCD with three degenerate quark flavours at zero baryon density exhibits a first order thermal phase transition for small quark masses, which changes to a smooth crossover for some critical quark mass m^c_0, i.e. the chiral critical point.…

We develop a theoretical approach to compute the conditioned spectral density of $N \times N$ non-invariant random matrices in the limit $N \rightarrow \infty$. This large deviation observable, defined as the eigenvalue distribution…

The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH). Recently, the works of Abboud, Hansen, Vassilevska W. and…

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we investigate a descriptor approach based on lattice properties. This paper proposes a new way to…

An instance of a random constraint satisfaction problem defines a random subset S (the set of solutions) of a large product space (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and…