"Splnitelnost omezuj\u00EDc\u00EDch podm\u00EDnek a univerz\u00E1ln\u00ED algebra" . "Projekt se zab\u00FDv\u00E1 studiem v\u00FDpo\u010Detn\u00ED slo\u017Eitosti probl\u00E9mu splnitelnosti omezuj\u00EDc\u00EDch podm\u00EDnek (CSP) a \u00FAzce souvisej\u00EDc\u00EDch probl\u00E9m\u016F univerz\u00E1ln\u00ED algebry. C\u00EDlem je dok\u00E1zat dichotomickou hypot\u00E9zu Federa a Vardiho pro co nej\u0161ir\u0161\u00ED t\u0159\u00EDdu CSP probl\u00E9m\u016F a prohloubit relevantn\u00ED univerz\u00E1ln\u011B algebraick\u00E9 poznatky." . . "2015-03-02+01:00"^^ . . . . . "The subject of the project is the computational complexity of the Constraint Satisfaction Problem (CSP). The goal is to prove the dichotomy conjecture of Feder and Vardi for a broad class of\u00A0CSP problems. In particular, we will study the bounded width problems and CSPs for various classes of digraphs, including oriented trees and smooth digraphs expansions. The next aim is to deepen the\u00A0universal algebra results, wich are useful in the CSP area. This especially concerns Malcev conditions for finite algebras, where we will continue the research on cyclic terms."@en . . "12"^^ . . . "12"^^ . "GP201/09/P223" . " univerz\u00E1ln\u00ED algebra" . . "The project was excellent, both in terms of expertise and in terms of disbursement of funds."@en . "2009-01-01+01:00"^^ . "splnitelnost omezuj\u00EDc\u00EDch podm\u00EDnek; univerz\u00E1ln\u00ED algebra; barven\u00ED grafu"@en . "2011-12-31+01:00"^^ . "0"^^ . "http://www.isvav.cz/projectDetail.do?rowId=GP201/09/P223"^^ . . . "0"^^ . "1"^^ . "Constraint satisfaction problem and universal algebra"@en . "2011-04-16+02:00"^^ . . "splnitelnost omezuj\u00EDc\u00EDch podm\u00EDnek" . . . . . "\u0158e\u0161en\u00ED projektu prob\u011Bhlo na vynikaj\u00EDc\u00ED \u00FArovni, a to jak z hlediska odborn\u00E9ho tak i z hlediska \u010Derp\u00E1n\u00ED finan\u010Dn\u00EDch prost\u0159edk\u016F."@cs . . . .