Algebraic structures in combinatorial problems

81 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Bounded width problems and algebras (2007, methodology): “It follows from results in [11] and [9] that if a finite algebra A is locally tractable then so is every finite algebra in V(A).”
A Dichotomy Theorem for Nonuniform CSPs (2017, background): “The hardness part of this theorem is proved in [25]; the equivalence of (2) and (3) was proved in [24] and [52].”
Existence theorems for weakly symmetric operations (2008, background): “10 show that (2) and (3) are equivalent.”
Combinatorial problems raised from 2-semilattices (2006, methodology): “The latter approach has been developed in [6,9], and allows one to parameterize subclasses of the CSP over a finite set of values by finite algebras such that the complexity of a subclass is completely determined by the properties of the corresponding algebra.”