The complexity of soft constraint satisfaction von Cohen, David A., Cooper, Martin C., Jeavons, Peter G., Krokhin, Andrei A.

Volltext

Complexity Dichotomies for CSP-related Problems von Nordh, Gustav

Volltext bestellen

Constraint Satisfaction Problems and Finite Algebras von Bulatov, Andrei A., Krokhin, Andrei A., Jeavons, Peter

Volltext

Clones preserving a quasi-order von Krokhin, Andrei A

Volltext bestellen

Algebraic Approach to Promise Constraint Satisfaction von Barto, Libor, Bulín, Jakub, Krokhin, Andrei, Opršal, Jakub

Volltext

Classifying the complexity of constraints using finite algebras von BULATOV, Andrei, JEAVONS, Peter, KROKHIN, Andrei

Volltext

Topology and Adjunction in Promise Constraint Satisfaction von Krokhin, Andrei, Opršal, Jakub, Wrochna, Marcin, Živný, Stanislav

Volltext

Functors on Relational Structures Which Admit Both Left and Right Adjoints von Dalmau, Víctor, Krokhin, Andrei, Opršal, Jakub

Volltext

The Complexity of General-Valued CSPs von Kolmogorov, Vladimir, Krokhin, Andrei, Rolínek, Michal

Volltext

Characterizations of several Maltsev conditions von Kozik, Marcin, Krokhin, Andrei, Valeriote, Matt, Willard, Ross

Volltext

Towards a characterization of constant-factor approximable finite-valued CSPs von Dalmau, Víctor, Krokhin, Andrei, Manokaran, Rajsekar

Volltext

Skew Bisubmodularity and Valued CSPs von Huber, Anna, Krokhin, Andrei, Powell, Robert

Volltext

Towards a characterization of constant-factor approximable finite-valued CSPs von Dalmau, Víctor, Krokhin, Andrei, Manokaran, Rajsekar

Volltext

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs von Dalmau, Víctor, Kozik, Marcin, Krokhin, Andrei, Makarychev, Konstantin, Makarychev, Yury, Opršal, Jakub

Volltext

Oracle Tractability of Skew Bisubmodular Functions von Huber, Anna, Krokhin, Andrei

Volltext

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra von Krokhin, Andrei, Jeavons, Peter, Jonsson, Peter

Volltext

Robust algorithms with polynomial loss for near-unanimity CSPs von Dalmau, Víctor, Kozik, Marcin, Krokhin, Andrei, Makarychev, Konstantin, Makarychev, Yury, Opršal, Jakub

Volltext

Hard constraint satisfaction problems have hard gaps at location 1 von Jonsson, Peter, Krokhin, Andrei, Kuivinen, Fredrik

Volltext

Robust Satisfiability for CSPs: Hardness and Algorithmic Results von Dalmau, Víctor, Krokhin, Andrei

Volltext

The approximability of three-valued MAX CSP von JONSSON, Peter, KLASSON, Mikael, KROKHIN, Andrei

Volltext