F. Boerner
Quantified constraints: Algorithms and complexity
Boerner, F.; Bulatov, A.; Jeavons, P.; Krokhin, A.
Authors
Contributors
M. Baaz
Editor
J.A. Makowsky
Editor
Citation
Boerner, F., Bulatov, A., Jeavons, P., & Krokhin, A. (2003). Quantified constraints: Algorithms and complexity. In M. Baaz, & J. Makowsky (Eds.),
| Presentation Conference Type | Conference Paper (Published) |
|---|---|
| Conference Name | 17th International Workshop on Computer Science Logic |
| Publication Date | 2003 |
| Publisher | Springer Verlag |
| Volume | 2803 |
| Pages | 58-70 |
| Series Title | Lecture Notes in Computer Science |
| Public URL | https://durham-repository.worktribe.com/output/1163664 |
You might also like
Algebraic approach to promise constraint satisfaction
(2019)
Presentation / Conference Contribution
The complexity of 3-colouring H-colourable graphs
(2020)
Presentation / Conference Contribution
Robust algorithms with polynomial loss for near-unanimity CSPs
(2017)
Presentation / Conference Contribution
The Complexity of General-Valued CSPs
(2015)
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