Coarse and Sharp Transitions for Random Generalized Satisfyability Problems
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 507-516
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Models for Random Constraint Satisfaction ProblemsSIAM Journal on Computing, 2003
- Generalized satisfiability problems: minimal elements and phase transitionsTheoretical Computer Science, 2002
- EditorialTheoretical Computer Science, 2001
- Rigorous results for random (2+p)-SATTheoretical Computer Science, 2001
- Complexity Classifications of Boolean Constraint Satisfaction Problems2001
- Sharp thresholds for certain Ramsey properties of random graphsRandom Structures & Algorithms, 2000
- 2+p-SAT: Relation of typical-case complexity to the nature of the phase transitionRandom Structures & Algorithms, 1999
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994
- Supersaturated graphs and hypergraphsCombinatorica, 1983