![]() |
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
We present the proof of Constraint Satisfaction Problem (CSP) Dichotomy Conjecture for 5-element domain. Precisely, we prove the remaining part of this conjecture showing that a CSP instance can be solved in polynomial time if all constraints are preserved by a Weak Near-Unanimity operation.