Satisfiability Threshold for Random Regular nae-sat
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 k[subscript 0] , we establish explicitly the satisfiability threshold d⋆≡d⋆(k). We prove that for d<d⋆ the problem is satisfiable with high probability...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer-Verlag,
2017-06-02T20:20:17Z.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Summary: | 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 k[subscript 0] , 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. This is the first result to locate the exact satisfiability threshold in a random constraint satisfaction problem exhibiting the condensation phenomenon identified by Krz̧akała et al. [Proc Natl Acad Sci 104(25):10318-10323, 2007]. Our proof verifies the one-step replica symmetry breaking formalism for this model. We expect our methods to be applicable to a broad range of random constraint satisfaction problems and combinatorial problems on random graphs. American Society for Engineering Education. National Defense Science and Engineering Graduate Fellowship National Science Foundation (U.S.). Graduate Research Fellowship Program |
|---|