The probabilistic analysis of a greedy satisfiability algorithm

Authors:
Alexis C. Kaporis;Lefteris M. Kirousis;Efthimios G. Lalas
Affiliations:
Department of Computer Engineering and Informatics University Campus, University of Patras, GR-265 04 Patras, Greece;Department of Computer Engineering and Informatics University Campus, University of Patras, GR-265 04 Patras, Greece;Department of Computer Engineering and Informatics University Campus, University of Patras, GR-265 04 Patras, Greece
Venue:
Random Structures & Algorithms
Year:
2006

Citing 39
Cited 14

Hard examples for resolution

Journal of the ACM (JACM)
Probabilistic analysis of two heuristics for the 3-satisfiability problem

SIAM Journal on Computing
Many hard examples for resolution

Journal of the ACM (JACM)
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

Information Sciences: an International Journal
Average-case analysis of algorithms and data structures

Handbook of theoretical computer science (vol. A)
Analysis of two simple heuristics on a random instance of k-SAT

Journal of Algorithms
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Sudden emergence of a giant k-core in a random graph

Journal of Combinatorial Theory Series B
A threshold for unsatisfiability

Journal of Computer and System Sciences
Tail bounds for occupancy and the satisfiability threshold conjecture

Random Structures & Algorithms
The degree sequence of a random graph. I. The models

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
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
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
Random 2-SAT and unsatisfiability

Information Processing Letters
Typical random 3-SAT formulae and the satisfiability threshold

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
2+p-SAT: relation of typical-case complexity to the nature of the phase transition

Random Structures & Algorithms - Special issue on statistical physics methods in discrete probability, combinatorics, and theoretical computer science
Bounding the unsatisfiability threshold of random 3-SAT

Random Structures & Algorithms
New methods to color the vertices of a graph

Communications of the ACM
A machine program for theorem-proving

Communications of the ACM
The scaling window of the 2-SAT transition

Random Structures & Algorithms
A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Results related to threshold phenomena research in satisfiability: lower bounds

Theoretical Computer Science - Phase transitions in combinatorial problems
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
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
On the critical exponents of random k-SAT

Random Structures & Algorithms
The Asymptotic Order of the Random k -SAT Threshold

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Probabilistic Analysis of a Greedy Satisfiability Algorithm

ESA '02 Proceedings of the 10th Annual European Symposium on 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
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
Generating Random Regular Graphs Quickly

Combinatorics, Probability and Computing
Random $k$-SAT: Two Moments Suffice to Cross a Sharp Threshold

SIAM Journal on Computing
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Hard and easy distributions of SAT problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

On the satisfiability threshold and clustering of solutions of random 3-SAT formulas

Theoretical Computer Science
Message-passing and local heuristics as decimation strategies for satisfiability

Proceedings of the 2009 ACM symposium on Applied Computing
On the satisfiability threshold of formulas with three literals per clause

Theoretical Computer Science
A Better Algorithm for Random k-SAT

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Relaxed survey propagation for the weighted maximum satisfiability problem

Journal of Artificial Intelligence Research
A Better Algorithm for Random $k$-SAT

SIAM Journal on Computing
On belief propagation guided decimation for random k-SAT

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Survey: The cook-book approach to the differential equation method

Computer Science Review
Exponential lower bounds for DPLL algorithms on satisfiable random 3-CNF formulas

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SATLab: X-raying random k-SAT

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
Decentralized constraint satisfaction

IEEE/ACM Transactions on Networking (TON)
An algorithm for random signed 3-SAT with intervals

Theoretical Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of clauses, irrespective of their size and the number of occurrences of the negation of the literal (ties are broken randomly; 1-clauses when they appear get priority). We prove that for r3 r3 r3