A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy - Complexity of constraint satisfaction - Document - PDFSEARCH.IO

First Page	Meta Content
	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu Add to Reading List Document Date: 2008-09-17 15:06:39 Open Document File Size: 213,03 KB Share Result on Facebook

A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.eduAdd to Reading List