Resolution complexity of random constraint satisfaction problems: another half of the story

Authors:
Yong Gao;Joseph Culberson
Affiliations:
Irvin K. Barber School of Arts and Sciences, University of British Columbia—, Okanagan kelowna, Canada and Department of Computing Science, University of Alberta, Edmonton, Alta., Canada;Department of Computing Science, University of Alberta, Edmonton, Alta., Canada
Venue:
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Year:
2005

Citing 12
Cited 0

A threshold for unsatisfiability

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

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

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
Models and thresholds for random constraint satisfaction problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The phase transition in a random hypergraph

Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Random Constraint Satisfaction: Flaws and Structure

Constraints
A perspective on certain polynomial-time solvable classes of satisfiability

Discrete Applied Mathematics
Resolution Complexity of Random Constraints

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The Resolution Complexity of Random Constraint Satisfaction Problems

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An analysis of phase transition in NK landscapes

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let Cn,m2,k,t be a random constraint satisfaction problem (CSP) on n binary variables, where m constraints are selected uniformly at random from all the possible k-ary constraints each of which contains exactly t tuples of the values as its restrictions. We establish an upper bound on the constraint tightness threshold for Cn,m2,k,t to have an exponential resolution complexity. The upper bound partly answers the open problem regarding the CSP resolution complexity with the tightness between the existing upper and lower bounds [D. Mitchell, Resolution complexity of random constraints, in: Proceedings Principles and Practices of Constraint Programming--CP 2002, Springer, Berlin, 2002, pp. 295-309].