Information Sciences: an International Journal
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
Exponential bounds for DPLL below the satisfiability threshold
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold
SIAM Journal on Computing
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
BerkMin: A fast and robust Sat-solver
Discrete Applied Mathematics
Mick gets some (the odds are on his side) (satisfiability)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Algorithmic Barriers from Phase Transitions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |
Let $\boldsymbol{\Phi}$ be a uniformly distributed random $k$-SAT formula with $n$ variables and $m$ clauses. We present a polynomial time algorithm that finds a satisfying assignment of $\boldsymbol{\Phi}$ with high probability for constraint densities $m/nJ. Algorithms, 20 (1996), pp. 312-355].