A Galois connection for weighted (relational) clones of infinite size
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-gener...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Association for Computing Machinery
2015
|