Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael Molloy, Mohammad R. Salavatipour. The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM Journal on Computing, 37(3):895-922, 2007. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction ProblemsAlan M. Frieze, Michael Molloy. random 2003: 275-289 [doi] The Resolution Complexity of Random Constraint Satisfaction ProblemsMichael Molloy, Mohammad R. Salavatipour. focs 2003: 330-339 [doi] A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction ProblemsSiu On Chan, Michael Molloy. focs 2008: 634-643 [doi] A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction ProblemsSiu On Chan, Michael Molloy. SICOMP, 42(1):27-60, 2013. [doi]
The following publications are possibly variants of this publication: