Složitost Booleovských funkcí
Complexity of Boolean functions
bachelor thesis (DEFENDED)
![Document thumbnail](/bitstream/handle/20.500.11956/27851/thumbnail.png?sequence=6&isAllowed=y)
View/ Open
Permanent link
http://hdl.handle.net/20.500.11956/27851Identifiers
Study Information System: 63258
Collections
- Kvalifikační práce [11266]
Author
Advisor
Referee
Koucký, Michal
Faculty / Institute
Faculty of Mathematics and Physics
Discipline
Mathematical Methods of Information Security
Department
Department of Algebra
Date of defense
29. 6. 2009
Publisher
Univerzita Karlova, Matematicko-fyzikální fakultaLanguage
Czech
Grade
Excellent