# Satisfiability threshold for random regular NAE-SAT

@article{Ding2014SatisfiabilityTF,
title={Satisfiability threshold for random regular NAE-SAT},
author={Jian Ding and Allan Sly and Nike Sun},
journal={Proceedings of the forty-sixth annual ACM symposium on Theory of computing},
year={2014}
}
• Published 2014
• Computer Science, Mathematics, Physics
• Proceedings of the forty-sixth annual ACM symposium on Theory of computing
We consider the random regular k-nae-sat problem with n variables each appearing in exactly d clauses. For all k exceeding an absolute constant k0, we establish explicitly the satisfiability threshold d* ∈ d*(k). We prove that for d < d* the problem is satisfiable with high probability while for d > d* the problem is unsatisfiable with high probability. If the threshold d* lands exactly on an integer, we show that the problem is satisfiable with probability bounded away from both zero and one… Expand

#### Paper Mentions

Breaking of 1RSB in Random Regular MAX-NAE-SAT
• Computer Science, Mathematics
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
In the random regular NAE-SAT model, the 1RSB description breaks down by a certain threshold density that is estimated rather precisely, and this is proved by an explicit perturbation in the 2RSB parameter space. Expand
The Number of Solutions for Random Regular NAE-SAT
• Mathematics, Computer Science
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
It is proved here that random regular NAE-SAT solutions have a well-defined free energy (limiting exponential growth rate), with explicit value matching the one-step replica symmetry breaking prediction. Expand
Satisfiability Threshold for Random Regular nae-sat
• Mathematics
• 2016
We consider the random regular k-nae- sat problem with n variables, each appearing in exactly d clauses. For all k exceeding an absolute constant $${{\it k}_0}$$k0, we establish explicitly theExpand
UPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM ( k , s )-SAT PROBLEM
• 2016
We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γthExpand
Proof of the Satisfiability Conjecture for Large k
• Mathematics, Computer Science
• STOC
• 2015
The satisfiability threshold αs is established, given explicitly by the one-step replica symmetry breaking (1SRB) prediction from statistical physics, and it is believed that the methods may apply to a range of random constraint satisfaction problems in the 1RSB class. Expand
The threshold for SDP-refutation of random regular NAE-3SAT
• Computer Science, Mathematics
• SODA
• 2019
It is shown that the latter situation prevails, at least in the context of random regular instances and SDP-based refutation, and the following sharp threshold result regarding efficient refutation is established: if $d 13.5$ then even the most basic spectral algorithm refutes satisfiability~(whp). Expand
One-step replica symmetry breaking of random regular NAE-SAT.
• Mathematics, Physics
• 2020
In a broad class of sparse random constraint satisfaction problems(CSP), deep heuristics from statistical physics predict that there is a condensation phase transition before the satisfiabilityExpand
Phase Transition for Maximum Not-All-Equal Satisfiability
• Mathematics, Computer Science
• FAW
• 2017
This paper uses first-moment method to obtain an upper bound for f(n, rn) the expectation of the maximum number of NAE-satisfied clauses of random Max NAE k-SAT, an optimization of not-all-equal satisfiability problem (NAE SAT). Expand
The Phase Transition Analysis for the Random Regular Exact 2-(d, k)-SAT Problem
• Guo-Qing Nie, Xiaofeng Wang, Xi Wang
• Computer Science
• Symmetry
• 2021
The (d,k)-SAT instance generation model is introduced, the solution space is constructed, and the method of the first and second moments to present the phase transition point d* of the 2-exactly satisfiable 2-(d, k)-S AT instance with only positive literals is employed. Expand
Satisfiability Thresholds for Regular Occupation Problems
• Mathematics, Computer Science
• ICALP
• 2019
A surprising and explicit connection is discovered between the $2-in-$k$occupation problem satisfiability threshold and the determination of contraction coefficients, an important quantity in information theory measuring the loss of information that occurs when communicating through a noisy channel. Expand #### References SHOWING 1-10 OF 60 REFERENCES Going after the k-SAT threshold • Mathematics, Computer Science • STOC '13 • 2013 A new asymmetric second moment method is developed that allows us to tackle the k-SAT threshold head on for the first time in the theory of random CSPs and matches the best bound that can be obtained from the so-called "replica symmetric" version of the cavity method. Expand The Satisfiability Threshold for k-XORSAT • Mathematics, Computer Science • Combinatorics, Probability and Computing • 2015 It is shown that m/n = 1 remains a sharp threshold for satisfiability of constrained k-XORSAT for every k ⩾ 3, and standard results on the 2-core of a random k-uniform hypergraph are used to extend this result to find the threshold for unconstrained k- XORSAT. Expand On the satisfiability threshold and clustering of solutions of random 3-SAT formulas • Mathematics, Computer Science • Theor. Comput. Sci. • 2008 It is shown that a random formula of density @a>=4.453 almost surely has no non-trivial ''core'' assignments, which implies that either this does not hold for 3-Sat, or the threshold density for satisfiability in 3- Sat lies below 4.453. Expand Random K-satisfiability problem: from an analytic solution to an efficient algorithm. • Mathematics, Medicine • Physical review. E, Statistical, nonlinear, and soft matter physics • 2002 The fundamental order parameter introduced in the cavity method, which consists of surveys of local magnetic fields in the various possible states of the system, can be computed for one given sample. Expand Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold • Mathematics, Computer Science • SIAM J. Comput. • 2006 It is proved that the threshold for both random hypergraph 2-colorability and random Not-All-Equal$k$-SAT is$2^{k-1}\ln 2 -O(1)\$, resolving a long-standing open problem. Expand
Random 2-SAT: results and problems
• W. Vega
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2001
The main steps in the solution of the random 2-SAT problem are reviewed, starting with the location of the asymptotic critical ratio around 8 years ago and ending with the recent almost complete solution due to Bollob4as et al. Expand
Approximating the unsatisfiability threshold of random formulas
• Mathematics
• 1998
Let f be a random Boolean formula that is an instance of 3-SAT. We consider the problem of computing the least real number k such that if the ratio of the number of clauses over the number ofExpand
Frozen variables in random boolean constraint satisfaction problems
• Computer Science, Mathematics
• SODA
• 2013
We determine the exact freezing threshold, r^f, for a family of models of random boolean constraint satisfaction problems, including NAE-SAT and hypergraph 2-colouring, when the constraint size isExpand
Random Formulas Have Frozen Variables
• Mathematics, Computer Science
• SIAM J. Comput.
• 2009
It is proved that inside every cluster the vast majority of variables are frozen, i.e., take only one value, which gives a satisfying intuitive explanation for the failure of the polynomial-time algorithms analyzed so far. Expand
The scaling window of the 2-SAT transition
• Mathematics, Physics
• Random Struct. Algorithms
• 2001
Using this order parameter, it is proved that the 2-SAT phase transition is continuous with an order parameter critical exponent of 1 and the values of two other critical exponents are determined, showing that the exponents of 2- SAT are identical to those of the random graph. Expand