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 …
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 …
Ivo G. Rosenberg's Work on Maximal Clones and Minimal Clones
A Szendrei - arXiv preprint arXiv:2406.15184, 2024 - arxiv.org
arXiv:2406.15184v1 [math.LO] 21 Jun 2024 Page 1 arXiv:2406.15184v1 [math.LO] 21 Jun 2024
IVO G. ROSENBERG’S WORK ON MAXIMAL CLONES AND MINIMAL CLONES ÁGNES …
IVO G. ROSENBERG’S WORK ON MAXIMAL CLONES AND MINIMAL CLONES ÁGNES …
Surjective H-colouring over reflexive digraphs
B Larose, B Martin, D Paulusma - ACM Transactions on Computation …, 2018 - dl.acm.org
The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective
homomorphism to a fixed graph H. The complexity of this problem has been well studied for …
homomorphism to a fixed graph H. The complexity of this problem has been well studied for …
A characterization of minimal locally finite varieties
K Kearnes, Á Szendrei - Transactions of the American Mathematical …, 1997 - ams.org
In this paper we describe a one–variable Mal′ cev–like condition satisfied by any locally
finite minimal variety. We prove that a locally finite variety is minimal if and only if it satisfies …
finite minimal variety. We prove that a locally finite variety is minimal if and only if it satisfies …
On the (un) decidability of a near-unanimity term
M Maróti - Algebra universalis, 2007 - Springer
We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-
unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a …
unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a …
Algorithms for categorical equivalence
C Bergman, J Berman - Mathematical Structures in Computer …, 1998 - cambridge.org
This paper provides an algorithm that, given two finite algebras A and B each of arbitrary
finite similarity type, determines whether or not A and B are categorically equivalent …
finite similarity type, determines whether or not A and B are categorically equivalent …
Monoid intervals in lattices of clones
AA Krokhin - Algebra and Logic, 1995 - Springer
Suppose A is a finite set. For every clone C over A, the family C (1) of all unary functions in C
is a monoid of transformations of the set A. We study how the lattice of clones is partitioned …
is a monoid of transformations of the set A. We study how the lattice of clones is partitioned …
Tricolorable torus knots are NP-complete
P Golbus, RW McGrail, T Przytycki, M Sharac… - Proceedings of the 47th …, 2009 - dl.acm.org
This work presents a method for associating a class of constraint satisfaction problems to a
three-dimensional knot. Given a knot, one can build a knot quandle, which is generally an …
three-dimensional knot. Given a knot, one can build a knot quandle, which is generally an …
Collapsing monoids containing permutations and constants
A Fearnley, IG Rosenberg - algebra universalis, 2003 - Springer
In 1941, Post [9] presented the complete description of the countably many clones on 2
elements. The structure of the lattice of clones on finitely many (but more than 2) elements is …
elements. The structure of the lattice of clones on finitely many (but more than 2) elements is …