On 13.12.2007 at 12:20 in S5, there is the following noon lecture:
Weak near-unanimity and constraint satisfaction problems
We will discuss how weak near-unanimity operations can be used to prove the NP-completeness of constraint satisfaction problems. As an application, we will outline the proof of dichotomy for a class of graphs, called special triads.
Webmaster: kamweb.mff.cuni.cz Modified: 25. 02. 2019