- The complexity of constraint satisfaction: an algebraic approach
- Submitted to the Symposium on Theoretical Aspects of Computer Science www.stacs-conf.org
- Functions of multiplevalued logic and the complexity of constraint satisfaction
- Complexity Classication in Qualitative Temporal Constraint Reasoning
- Computational Complexity of Auditing Finite Attributes in Statistical Databases
- RETRACTIONS TO PSEUDOFORESTS TOMAS FEDER, PAVOL HELL, PETER JONSSON, ANDREI KROKHIN, AND
- Recognizing Frozen Variables in Constraint Satisfaction Problems
- Congruences of clone lattices, I A.A.Krokhin, A.P.Semigrodskikh
- A monoidal interval of clones of selfdual functions
- The complexity of the list homomorphism problem for graphs
- Extending the Point Algebra into the Qualitative Algebra Andrei Krokhin
- Boolean lattices as intervals in clone lattices
- Congruences of clone lattices, II Andrei A. Krokhin
- Reasoning About Temporal Relations: The Tractable Subalgebras
- A monoidal interval of isotone clones on a nite chain
- On the hardness of losing weight ANDREI KROKHIN
- Hard constraint satisfaction problems have hard gaps at location 1 1
- Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems
- Retractions onto series-parallel posets Victor Dalmau
- The Complexity of Soft Constraint Satisfaction David A. Cohen,
- CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS
- Complexity of Clausal Constraints Over Chains Nadia Creignou
- Firstorder definable retraction problems for posets and reflexive graphs Vctor Dalmau
- CSP duality and trees of bounded pathwidth Catarina Carvalhoa
- Algebra univers. (1997) --5240/97/040527
- On clones preserving a re exive binary relation
- Algebra univers. 0002--5240/01/020231
- Dualities for Constraint Satisfaction Problems Andrei Bulatov1
- Supermodular Functions and the Complexity of Max CSP #
- Quanti ed Constraints: Algorithms and Complexity
- CSP duality and trees of bounded pathwidth Catarina Carvalhoa
- arXiv:cs.CC/0412042 The approximability of three-valued Max CSP
- A Complete Classification of Complexity in Allen's Algebra in the Presence of a NonTrivial Basic Relation
- Maximum Constraint Satisfaction on Diamonds Andrei Krokhin 1 and Benoit Larose 2
- On the structure of clone lattices, II
- Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
- Maximal Tractable Class Soft Constraints David Cohen
- The Complexity of Constraint Satisfaction Games and QCSP
- A note on supermodular sublattices in finite relatively complemented lattices
- The approximability of Max CSP with fixed-value constraints Vladimir Deineko
- Solving Order Constraints in Logarithmic Space Andrei Krokhin 1? and Benoit Larose 2??
- Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction
- The Complexity of Constraints on Intervals and Lengths
- Maximal Tractable Class Soft Constraints A Maximal Tractable Class of Soft Constraints
- Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1--1 Supermodularity on chains and complexity of
- On the hardness of losing weight Andrei Krokhin1