Andrei Krokhin
Zitiert von
Zitiert von
Classifying the complexity of constraints using finite algebras
A Bulatov, P Jeavons, A Krokhin
SIAM journal on computing 34 (3), 720-742, 2005
Constraint satisfaction problems and finite algebras
AA Bulatov, AA Krokhin, P Jeavons
International Colloquium on Automata, Languages, and Programming, 272-282, 2000
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
A Krokhin, P Jeavons, P Jonsson
Journal of the ACM (JACM) 50 (5), 591-640, 2003
The complexity of soft constraint satisfaction
DA Cohen, MC Cooper, PG Jeavons, AA Krokhin
Artificial Intelligence 170 (11), 983-1016, 2006
Polymorphisms, and how to use them
L Barto, A Krokhin, R Willard
Dagstuhl Follow-Ups 7, 2017
The complexity of maximal constraint languages
A Bulatov, A Krokhin, P Jeavons
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
Quantified constraints: Algorithms and complexity
F Börner, A Bulatov, P Jeavons, A Krokhin
International Workshop on Computer Science Logic, 58-70, 2003
The complexity of general-valued CSPs
V Kolmogorov, A Krokhin, M Rolínek
SIAM Journal on Computing 46 (3), 1087-1110, 2017
Dualities for constraint satisfaction problems
AA Bulatov, A Krokhin, B Larose
Complexity of Constraints, 93-124, 2008
Characterizations of several Maltsev conditions
M Kozik, A Krokhin, M Valeriote, R Willard
Algebra universalis 73 (3), 205-224, 2015
A maximal tractable class of soft constraints
D Cohen, M Cooper, P Jeavons, A Krokhin
Journal of Artificial Intelligence Research 22, 1-22, 2004
The complexity of constraint satisfaction games and QCSP
F Börner, A Bulatov, H Chen, P Jeavons, A Krokhin
Information and Computation 207 (9), 923-944, 2009
The approximability of three-valued Max CSP
P Jonsson, M Klasson, A Krokhin
SIAM Journal on Computing 35 (6), 1329-1349, 2006
Algebraic approach to promise constraint satisfaction
J Bulín, A Krokhin, J Opršal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
The approximability of Max CSP with fixed-value constraints
V Deineko, P Jonsson, M Klasson, A Krokhin
Journal of the ACM (JACM) 55 (4), 1-37, 2008
Supermodular functions and the complexity of MAX CSP
D Cohen, M Cooper, P Jeavons, A Krokhin
Discrete Applied Mathematics 149 (1-3), 53-72, 2005
Skew bisubmodularity and valued CSPs
A Huber, A Krokhin, R Powell
SIAM Journal on Computing 43 (3), 1064-1084, 2014
Majority constraints have bounded pathwidth duality
V Dalmau, A Krokhin
European Journal of Combinatorics 29 (4), 821-837, 2008
The complexity of constraint satisfaction: an algebraic approach
A Krokhin, A Bulatov, P Jeavons
Structural theory of automata, semigroups, and universal algebra, 181-213, 2005
Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction
A Krokhin, B Larose
SIAM Journal on Discrete Mathematics 22 (1), 312-328, 2008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20