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 |