Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

Authors:
John Franco
Affiliations:
ECECS, University of Cincinnati, Cincinnati, OH 45221-0030, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 48
Cited 1

On the probabilistic performance of algorithms for the satisfiability problem

Information Processing Letters
Hard examples for resolution

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

SIAM Journal on Computing
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

Discrete Applied Mathematics
Many hard examples for resolution

Journal of the ACM (JACM)
Probabilistic performance of a heuristic for the satisfiability problem

Discrete Applied Mathematics
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

Information Sciences: an International Journal
Extended Horn sets in propositional logic

Journal of the ACM (JACM)
Elimination of infrequent variables improves average case performance of satisfiability algorithms

SIAM Journal on Computing
A Complexity Index for Satisfiability Problems

SIAM Journal on Computing
Recognition of q-Horn formulae in linear time

Discrete Applied Mathematics
On finding solutions for extended Horn formulas

Information Processing Letters
Analysis of two simple heuristics on a random instance of k-SAT

Journal of Algorithms
A threshold for unsatisfiability

Journal of Computer and System Sciences
Probe Order Backtracking

SIAM Journal on Computing
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
On the complexity of unsatisfiability proofs for random k-CNF formulas

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating the unsatisfiability threshold of random formulas

Random Structures & Algorithms
The complexity of the matrix eigenproblem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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 Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set

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
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
Investigations on autark assignments

Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Short proofs are narrow—resolution made simple

Journal of the ACM (JACM)
The scaling window of the 2-SAT transition

Random Structures & Algorithms
Rigorous results for random (2 + p)-SAT

Theoretical Computer Science - Phase transitions in combinatorial problems
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
A perspective on certain polynomial-time solvable classes of satisfiability

Discrete Applied Mathematics
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 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 complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Generalized satisfiability problems: minimal elements and phase transitions

Theoretical Computer Science
A Short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index

A Short Note on Linear Autarkies, q-Horn Formulas and the Complexity Index
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Combinatorial sharpness criterion and phase transition classification for random CSPs

Information and Computation
Corrections for "On the lengths of proofs in the propositional calculus preliminary version"

ACM SIGACT News
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Phase transition of multivariate polynomial systems

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

This is a written record of a survey talk on the topic of typical case complexity of Satisfiability algorithms which was presented at the LICS workshop on this subject in June, 2003, Ottawa, Canada.