Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Algorithms and Complexity Theory
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
Andrei A. Bulatov and Victor Dalmau
Book Title
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS'03)
Year
2003
Links
BibTeX
Link
See Also
Constraint Satisfaction Problems
Algorithms and Complexity Theory
Activities
Projects
People
Publications
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centred Computing
Programming Languages
Quantum
Security
Systems
Back to Top