Probabilistic analysis of two heuristics for the 3-satisfiability problem
SIAM Journal on Computing
Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & 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
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bounding the unsatisfiability threshold of random 3-SAT
Random Structures & Algorithms
New methods to color the vertices of a graph
Communications of the ACM
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
Almost all graphs with average degree 4 are 3-colorable
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A note on random 2-SAT with prescribed literal degrees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The analysis of a list-coloring algorithm on a random graph
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Optimal myopic algorithms for random 3-SAT
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The unsatisfiability threshold revisited
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
On the critical exponents of random k-SAT
Random Structures & Algorithms
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Linear phase transition in random linear constraint satisfaction problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
A new look at survey propagation and its generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A sharp threshold for the renameable-Horn and the q-Horn properties
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
On the solution-space geometry of random constraint satisfaction problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Regular Random k-SAT: Properties of Balanced Formulas
Journal of Automated Reasoning
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Artificial Intelligence
Phase transitions of bounded satisfiability problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
Approximation algorithm for random MAX-kSAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Observed lower bounds for random 3-SAT phase transition density using linear programming
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Heuristics for fast exact model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A generating function method for the average-case analysis of DPLL
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Bounds on threshold of regular random k-SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A general model and thresholds for random constraint satisfaction problems
Artificial Intelligence
| Hi-index | 0.00 |
Consider the following simple, greedy Davis-Putnam algorithm applied to a random 3-CNF formula of constant density c: Arbitrarily set to TRUE a literal that appears in as many clauses as possible, irrespective of their size (and irrespective of the number of occurrences of the negation of the literal). Reduce the formula. If any unit clauses appear, then satisfy their literals arbitrarily, reducing the formula accordingly, until no unit clause remains. Repeat. We prove that for c c c 驴 3.6 is feasible running algorithms like the above, which take into account not only the number of occurrences of a literal but also the number of occurrences of its negation, irrespectively of clause-size information.