Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently

Authors:
Joel Friedman;Andreas Goerdt
Affiliations:
-;-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 11
Cited 1

Many hard examples for resolution

Journal of the ACM (JACM)
A randomised 3-colouring algorithm

Discrete Mathematics - Graph colouring and variations
A spectral technique for coloring random 3-colorable graphs (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Analysis of two simple heuristics on a random instance of k-SAT

Journal of Algorithms
Generating hard satisfiability problems

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Experimental results on the crossover point in random 3-SAT

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A threshold for unsatisfiability

Journal of Computer and System Sciences
Approximating the unsatisfiability threshold of random formulas

Random Structures & 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
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Mick gets some (the odds are on his side) (satisfiability)

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that random k-SAT instances with at least dn clauses where d = dk is a suitable constant are unsatisfiable (with high probability). This paper deals with the question to certify the unsatisfiability of a random 3-SAT instance in polynomial time. A backtracking based algorithm of Beame et al. works for random 3-SAT instances with at least n2/log n clauses. This is the best result known by now. We improve the n2/log n bound attained by Beame et al. to n3/2+Ɛ for any Ɛ 0. Our approach extends the spectral approach introduced to the study of random k-SAT instances for k ≥ 4 in previous work of the second author.