problém splnitelnosti omezujících podmínek|problém splnitelnosti omezujících podmínek se slib|konečná polynomiální řešitelnost|problém ověřování sentencí v modelech
English key words:
Constraint satisfaction problem|promise constraint satisfaction problem|finite tractability|model checking problem
hidden - assigned and confirmed by the Study Dept.
Date of registration:
29.10.2018
Date of assignment:
29.10.2018
Confirmed by Study dept. on:
29.10.2018
Date and time of defence:
14.08.2023 10:00
Date of electronic submission:
24.05.2023
Date of submission of printed version:
02.06.2023
Date of proceeded defence:
14.08.2023
Opponents:
prof. Martin Barnaby
RNDr. Stanislav Živný, Ph.D.
Guidelines
This is a work under the ERC CoG grant CoCoSym.
Specific topics of the thesis will be decided during the first year.
References
L. Barto, A. Krokhin, R. Willard, Polymorphisms, and how to use them, in "The Constraint Satisfaction Problem: Complexity and Approximability", Dagstuhl Follow-Ups, vol. 7, 1–44, 2017