Publication at Faculty of Mathematics and Physics |
2005
Abstract
We study constraint satisfaction problems with binary predicates without small sets of contradicting constraints. In this setting, we prove several optimal results on the best solution of such problems.