On the complexity of unsatisfiability proofs for random k-CNF formulas

Authors:
Paul Beame;Richard Karp;Toniann Pitassi;Michael Saks
Affiliations:
Computer Science, and Engineering, University of Washington, Box 352350, Seattle, WA;Computer Science and Engineering, University of Washington Box, 352350, Seattle, WA;Computer Science Department, University of Arizona, Tucson, AZ;Department of Mathematics, Rutgers University, New Brunswick, NJ
Venue:
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Year:
1998

Citing 10
Cited 27

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
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
Using the Groebner basis algorithm to find proofs of unsatisfiability

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold for unsatisfiability

Journal of Computer and System Sciences
A machine program for theorem-proving

Communications of the ACM
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

A sharp threshold in proof complexity

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Some interesting research directions in satisfiability

Annals of Mathematics and Artificial Intelligence
Stochastic Boolean Satisfiability

Journal of Automated Reasoning
A perspective on certain polynomial-time solvable classes of satisfiability

Discrete Applied Mathematics
On the Complexity of Resolution with Bounded Conjunctions

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Random 3-SAT: The Plot Thickens

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Random 3-SAT and BDDs: The Plot Thickens Further

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Resolution Complexity of Random Constraints

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Space complexity of random formulae in resolution

Random Structures & Algorithms
Random 3-SAT: The Plot Thickens

Constraints
On the limit of branching rules for hard random unsatisfiable 3-SAT

Discrete Applied Mathematics - The renesse issue on satisfiability
On sufficient conditions for unsatisfiability of random formulas

Journal of the ACM (JACM)
A sharp threshold in proof complexity yields lower bounds for satisfiability search

Journal of Computer and System Sciences - STOC 2001
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances

Theoretical Computer Science
Restarts and Exponential Acceleration of the Davis–Putnam–Loveland–Logemann Algorithm: A Large Deviation Analysis of the Generalized Unit Clause Heuristic for Random 3-SAT

Annals of Mathematics and Artificial Intelligence
Typical case complexity of satisfiability algorithms and the threshold phenomenon

Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Many hard examples in exact phase transitions

Theoretical Computer Science
Average-case complexity

Foundations and Trends® in Theoretical Computer Science
The complexity of properly learning simple concept classes

Journal of Computer and System Sciences
Empirical hardness models: Methodology and a case study on combinatorial auctions

Journal of the ACM (JACM)
Consistency and random constraint satisfaction models

Journal of Artificial Intelligence Research
Optimal refutations for constraint satisfaction problems

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon

Discrete Applied Mathematics
Resolution tunnels for improved SAT solver performance

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

Quantified Score

Hi-index	0.00

On the complexity of unsatisfiability proofs for random k-CNF formulas

Quantified Score

Visualization

Abstract