D. Cohen
Identifying efficiently solvable cases of Max CSP
Cohen, D.; Cooper, M.; Jeavons, P.; Krokhin, A.
Authors
Contributors
M. Habib
Editor
V. Diekert
Editor
Citation
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2004, December). Identifying efficiently solvable cases of Max CSP. Presented at 21st International Symposium on Theoretical Aspects of Computer Science
| Presentation Conference Type | Conference Paper (Published) |
|---|---|
| Conference Name | 21st International Symposium on Theoretical Aspects of Computer Science. |
| Publication Date | 2004 |
| Print ISSN | 0302-9743 |
| Publisher | Springer Verlag |
| Volume | 2996 |
| Pages | 152-163 |
| Series Title | Lecture Notes in Computer Science |
| Public URL | https://durham-repository.worktribe.com/output/1162378 |
You might also like
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
The complexity of 3-colouring H-colourable graphs
(2020)
Presentation / Conference Contribution
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Algebraic approach to promise constraint satisfaction
(2019)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search