Publikace na Matematicko-fyzikální fakulta |
2005
Abstrakt
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.