Outputs (6)

On clones preserving a reflexive binary relation (2001)
Journal Article
Krokhin, A., & Schweigert, D. (2001). On clones preserving a reflexive binary relation. Acta scientiarum mathematicarum, 67(3-4), 461-473

Congruences of clone lattices, II (2001)
Journal Article
Krokhin, A. (2001). Congruences of clone lattices, II. Order, 18(2), 151-159

On clones, transformation monoids and finite Boolean algebras (2001)
Journal Article
Krokhin, A. (2001). On clones, transformation monoids and finite Boolean algebras. Algebra Universalis, 46(1-2), 231-236

A complete classification of complexity in Allen's algebrain the presence of a non-trivial basic relation (2001)
Presentation / Conference Contribution
Krokhin, A., Jeavons, P., & Jonsson, P. (2001, December). A complete classification of complexity in Allen's algebrain the presence of a non-trivial basic relation. Presented at 17th International Joint Conference on Artificial Intelligence, {(IJCAI'01)

On the structure of clone lattices, II (2001)
Presentation / Conference Contribution
Bulatov, A., Krokhin, A., Safin, K., Semigrodskikh, A., & Sukhanov, E. (2001, December). On the structure of clone lattices, II

The complexity of maximal constraint languages (2001)
Presentation / Conference Contribution
Bulatov, A., Krokhin, A., & Jeavons, P. (2001, December). The complexity of maximal constraint languages. Presented at 33rd ACM Symposium on the Theory of Computing(STOC), Crete, Greece

Many combinatorial search problems can be expressed as “constraint satisfaction problems” using an appropriate “constraint language”, that is, a set of relations over some fixed finite set of values. It is well-known that there is a trade-off between... Read More about The complexity of maximal constraint languages.