Classifying the complexity of constraints using finite algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …
This class of problems is known to be NP-complete in general, but certain restrictions on the …
A dichotomy theorem for constraint satisfaction problems on a 3-element set
AA Bulatov - Journal of the ACM (JACM), 2006 - dl.acm.org
The Constraint Satisfaction Problem (CSP) provides a common framework for many
combinatorial problems. The general CSP is known to be NP-complete; however, certain …
combinatorial problems. The general CSP is known to be NP-complete; however, certain …
Constraint satisfaction problems and finite algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …
This class of problems is known to be NP-complete in general, but certain restrictions on the …
A dichotomy theorem for constraints on a three-element set
AA Bulatov - The 43rd Annual IEEE Symposium on …, 2002 - ieeexplore.ieee.org
The Constraint Satisfaction Problem (CSP) provides a common framework for many
combinatorial problems. The general CSP is known to be NP-complete; however, certain …
combinatorial problems. The general CSP is known to be NP-complete; however, certain …
The complexity of constraint satisfaction: an algebraic approach
Many computational problems arising in artificial intelligence, computer science and
elsewhere can be represented as constraint satisfaction and optimization problems. In this …
elsewhere can be represented as constraint satisfaction and optimization problems. In this …
Omitting types, bounded width and the ability to count
We say that a finite algebra 𝔸=〈 A; F〉 has the ability to count if there are subalgebras C of
𝔸3 and Z of 𝔸 such that the structure〈 A; C, Z〉 has the ability to count in the sense of Feder …
𝔸3 and Z of 𝔸 such that the structure〈 A; C, Z〉 has the ability to count in the sense of Feder …
Graphs of finite algebras: edges, and connectivity
AA Bulatov - Algebra universalis, 2024 - Springer
We refine and advance the study of the local structure of idempotent finite algebras started in
Bulatov (LICS, 2004). We introduce a graph-like structure on an arbitrary finite idempotent …
Bulatov (LICS, 2004). We introduce a graph-like structure on an arbitrary finite idempotent …
О строго простых тернарных алгебрах с операторами
ВЛ Усольцев - Чебышевский сборник, 2013 - cyberleninka.ru
В работе получены некоторые условия строгой простоты для алгебр с операторами,
имеющих одну тернарную основную операцию. Описаны строго простые унары со …
имеющих одну тернарную основную операцию. Описаны строго простые унары со …
Subquasivarieties of regularized varieties
C Bergman, A Romanowska - Algebra Universalis, 1996 - Springer
This paper considers the lattice of subquasivarieties of a regular variety. In particular we
show that if V is a strongly irregular variety that is minimal as a quasivariety, then the …
show that if V is a strongly irregular variety that is minimal as a quasivariety, then the …
Concatenation of regular languages and descriptional complexity
G Jirásková - Theory of Computing Systems, 2011 - Springer
We investigate the deterministic and nondeterministic state complexity of languages
resulting from the concatenation of two regular languages represented by deterministic and …
resulting from the concatenation of two regular languages represented by deterministic and …