Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor
Maximum constraint satisfaction on diamonds
Krokhin, A.; Larose, B.
Authors
B. Larose
Contributors
P ~van Beek
Editor
Citation
Krokhin, A., & Larose, B. (2005, December). Maximum constraint satisfaction on diamonds. Presented at 11th International Conference on Principles and Practice of Constraint Programming {(CP'05)
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | 11th International Conference on Principles and Practice of Constraint Programming {(CP'05) |
| Publication Date | 2005 |
| Print ISSN | 0302-9743 |
| Publisher | Springer Verlag |
| Volume | 3709 |
| Pages | 388-402 |
| Series Title | Lecture Notes in Computer Science |
| Public URL | https://durham-repository.worktribe.com/output/1695142 |
You might also like
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Towards a characterization of constant-factor approximable Finite-Valued CSPs
(2018)
Journal Article
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