A probabilistic analysis of randomly generated binary constraint satisfaction problems

Authors:
Martin Dyer;Alan Frieze;Michael Molloy
Affiliations:
School of Computer Studies, University of Leeds, Leeds LS2 9JT, UK;Department of Mathematical Sciences, Carnegie Mellon University, 5000 Forbes Avenue Pittsburgh, PA;Department of Computer Science, University of Toronto, Toronto, Ont. M5S 3G4, Canada
Venue:
Theoretical Computer Science
Year:
2003

Citing 3
Cited 4

Sudden emergence of a giant k-core in a random graph

Journal of Combinatorial Theory Series B
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
Constructing an asymptotic phase transition in random binary constraint satisfaction problems

Theoretical Computer Science - Phase transitions in combinatorial problems

The satisfiability threshold for randomly generated binary constraint satisfaction problems

Random Structures & Algorithms
Many hard examples in exact phase transitions

Theoretical Computer Science
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT

Theoretical Computer Science
A general model and thresholds for random constraint satisfaction problems

Artificial Intelligence

Quantified Score

Hi-index	5.23

Visualization

Abstract