|
|
|
||
Last update: T_KTI (10.04.2001)
|
|
||
Last update: prof. RNDr. Ondřej Čepek, Ph.D. (12.06.2019)
The aim of this course is to introduce to the students the foundations of Boolean function theory and perhaps also suggest possible topics for a master theses.
|
|
||
Last update: prof. RNDr. Ondřej Čepek, Ph.D. (26.09.2020)
There is only an oral exam. The subject of the exam can be anything covered in the course (including all proofs, of course). If the school is closed due to state regulations the exam will be administered online (via Zoom). |
|
||
Last update: prof. RNDr. Ondřej Čepek, Ph.D. (30.04.2015)
Y.Crama, P.L.Hammer, Boolean Functions - Theory, Algorithms, and Applications. Cambridge University Press, 2011. |
|
||
Last update: prof. RNDr. Ondřej Čepek, Ph.D. (12.06.2019)
Zkouška je pouze ústní, předmětem zkoušky může být cokoli z probrané látky (pochopitelně včetně důkazů). |
|
||
Last update: prof. RNDr. Ondřej Čepek, Ph.D. (30.04.2015)
1) Introduction to Boolean functions.
2) Implicants, consequents, resolution (consensus) and its completeness 3) Monotone functions and their basic properties 2) Regular functions.
3) Threshold functions.
4) Satisfiability of Boolean formulae
5) Minimal representation of Boolean functions.
|