Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
151
Voted
FOCS
2008
IEEE
110
views
Theoretical Computer Science
»
more
FOCS 2008
»
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
15 years 4 months ago
Download
www.cs.toronto.edu
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
claim paper
Read More »