Special Classes of Boolean Functions with Respect to the Complexity of their Minimization.
| Thesis title in Czech: | Speciální třídy Booleovských funkcí s ohledem na složitost jejich minimalizace |
|---|---|
| Thesis title in English: | Special Classes of Boolean Functions with Respect to the Complexity of their Minimization. |
| Key words: | Booleovské funkce, Splnitelnost (SAT), Booleovská minimalizace, Matched formule, Propagation completeness, Empowering implikáty |
| English key words: | Boolean functions, Satisfiability (SAT), Boolean minimization, Matched formulas, Propagation completeness, Empowering implicates |
| Academic year of topic announcement: | 2010/2011 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Department of Theoretical Computer Science and Mathematical Logic (32-KTIML) |
| Supervisor: | prof. RNDr. Ondřej Čepek, Ph.D. |
| Author: | Mgr. Bc. Štefan Gurský, Ph.D. - assigned and confirmed by the Study Dept. |
| Date of registration: | 18.11.2010 |
| Date of assignment: | 18.11.2010 |
| Date and time of defence: | 29.09.2014 14:00 |
| Date of electronic submission: | 12.06.2014 |
| Date of submission of printed version: | 13.06.2014 |
| Date of proceeded defence: | 29.09.2014 |
| Opponents: | Pierre Marquis |
| Mgr. Mikoláš Janota, Ph.D. | |