Krokhin, Andrei; Opršal, Jakub; Wrochna, Marcin; Živný, Stanislav Topology and adjunction in promise constraint satisfaction. (English) Zbl 07672224 SIAM J. Comput. 52, No. 1, 38-79 (2023). MSC: 68Q17 68Q25 68R05 05C15 PDFBibTeX XMLCite \textit{A. Krokhin} et al., SIAM J. Comput. 52, No. 1, 38--79 (2023; Zbl 07672224) Full Text: DOI arXiv
Dalmau, Víctor; Kozik, Marcin; Krokhin, Andrei; Makarychev, Konstantin; Makarychev, Yury; Opršal, Jakub Robust algorithms with polynomial loss for near-unanimity CSPs. (English) Zbl 1452.68087 SIAM J. Comput. 48, No. 6, 1763-1795 (2019). MSC: 68Q25 68Q17 68T20 68W20 68W25 68W40 PDFBibTeX XMLCite \textit{V. Dalmau} et al., SIAM J. Comput. 48, No. 6, 1763--1795 (2019; Zbl 1452.68087) Full Text: DOI arXiv
Dalmau, Víctor; Krokhin, Andrei; Manokaran, Rajsekar Towards a characterization of constant-factor approximable finite-valued CSPs. (English) Zbl 1398.68666 J. Comput. Syst. Sci. 97, 14-27 (2018). MSC: 68W25 08A70 68Q17 PDFBibTeX XMLCite \textit{V. Dalmau} et al., J. Comput. Syst. Sci. 97, 14--27 (2018; Zbl 1398.68666) Full Text: DOI arXiv Link
Krokhin, Andrei; Zivny, Stanislav The complexity of valued CSPs. (English) Zbl 1482.68165 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 233-266 (2017). MSC: 68R07 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{A. Krokhin} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 233--266 (2017; Zbl 1482.68165) Full Text: DOI
Barto, Libor; Krokhin, Andrei; Willard, Ross Polymorphisms, and how to use them. (English) Zbl 1482.68161 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 1-44 (2017). MSC: 68R07 08A70 68Q25 PDFBibTeX XMLCite \textit{L. Barto} et al., Dagstuhl Follow-Ups 7, 1--44 (2017; Zbl 1482.68161) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Krokhin, Andrei; Powell, Robert; Živný, Stanislav Binarisation for valued constraint satisfaction problems. (English) Zbl 1477.68121 SIAM J. Discrete Math. 31, No. 4, 2279-2300 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Discrete Math. 31, No. 4, 2279--2300 (2017; Zbl 1477.68121) Full Text: DOI arXiv
Kolmogorov, Vladimir; Krokhin, Andrei; Rolínek, Michal The complexity of general-valued CSPs. (English) Zbl 1371.68117 SIAM J. Comput. 46, No. 3, 1087-1110 (2017). MSC: 68Q25 PDFBibTeX XMLCite \textit{V. Kolmogorov} et al., SIAM J. Comput. 46, No. 3, 1087--1110 (2017; Zbl 1371.68117) Full Text: DOI arXiv