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
Publications
The complexity of conservative valued CSPs
The complexity of conservative valued CSPs
Vladimir Kolmogorov and Stanislav Živný
Note
arXiv:1110.2809
Year
2011
Links
BibTeX
Link
Algorithms and Complexity Theory
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
