The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem

Authors:
Harold Connamacher;Michael Molloy
Affiliations:
University of Toronto;University of Toronto
Venue:
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Year:
2004

Citing 0
Cited 4

Many hard examples in exact phase transitions

Theoretical Computer Science
Propagation connectivity of random hypergraphs

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

Theoretical Computer Science
Catching the k-NAESAT threshold

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We determine the exact threshold of satisfiability for random instances of a particular NP-hard constraint satisfaction problem. The problem appears to share many of the threshold characteristics of random k-SAT for k 驴 3; for example, we prove the problem almost surely has high resolution complexity.We also prove the analogue of the (2 + p)-SATconjecture for a class of problems that includes this problem and XOR-SAT.