Professor Andrei Krokhin andrei.krokhin@durham.ac.uk
Professor
Krokhin, A., & Zivny, S. (2017). The Constraint Satisfaction Problem: Complexity and Approximability. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Book Type | Authored Book |
---|---|
Publication Date | 2017 |
Deposit Date | Mar 9, 2017 |
Series Title | Dagstuhl Follow-Ups |
Public URL | https://durham-repository.worktribe.com/output/1122791 |
Publisher URL | http://www.dagstuhl.de/dagpub/978-3-95977-003-3 |
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
Binarisation for Valued Constraint Satisfaction Problems
(2017)
Journal Article
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
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