Average case complete problems
SIAM Journal on Computing
Journal of Computer and System Sciences
On the theory of average case complexity
Journal of Computer and System Sciences
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
A general upper bound for the satisfiability threshold of random r-SAT formulae
Journal of Algorithms
Approximating the unsatisfiability threshold of random formulas
Random Structures & Algorithms
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
Upper bounds on the satisfiability threshold
Theoretical Computer Science - Phase transitions in combinatorial problems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
Message-passing and local heuristics as decimation strategies for satisfiability
Proceedings of the 2009 ACM symposium on Applied Computing
The scaling window for a random graph with a given degree sequence
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
The decimation process in random k-SAT
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
On the relative merits of simple local search methods for the MAX-SAT problem
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Unsatisfiability bounds for random CSPs from an energetic interpolation method
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Decentralized constraint satisfaction
IEEE/ACM Transactions on Networking (TON)
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
| Hi-index | 0.00 |
Using the cavity equations of Mézard, Parisi, and Zecchina [Science 297 (2002), 812]; Mézard and Zecchina, [Phys Rev E 66 (2002), 056126] we derive the various threshold values for the number of clauses per variable of the random K-satisfiability problem, generalizing the previous results to K ≥ 4. We also give an analytic solution of the equations, and some closed expressions for these thresholds, in an expansion around large K. The stability of the solution is also computed. For any K, the satisfiability threshold is found to be in the stable region of the solution, which adds further credit to the conjecture that this computation gives the exact satisfiability threshold.© 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006