Publication at Faculty of Mathematics and Physics |
2006
Abstract
We apply algebraic approach to constraint satisfaction on infinite domain and classify complexity of all constraint languages that can be expressed as a boolean combination of = relation.