Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor
A complete classification of complexity in Allen's algebrain the presence of a non-trivial basic relation
Krokhin, A.; Jeavons, P.; Jonsson, P.
Authors
P. Jeavons
P. Jonsson
Contributors
B. Nebel
Editor
Citation
Krokhin, A., Jeavons, P., & Jonsson, P. (2001, December). A complete classification of complexity in Allen's algebrain the presence of a non-trivial basic relation. Presented at 17th International Joint Conference on Artificial Intelligence, {(IJCAI'01)
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 17th International Joint Conference on Artificial Intelligence, {(IJCAI'01) |
Publication Date | 2001 |
Pages | 83-88 |
Public URL | https://durham-repository.worktribe.com/output/1162332 |
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 © 2025
Advanced Search