Benjamin Saloň
Bachelor's thesis
Vylepšenie BoolTest-u
Improvements of the BoolTest
Abstract:
The bachelor thesis aims to explore the possibilities of improving BoolTest by approximation of Boolean functions. To this end, we have examined various methods for approximating Boolean functions. The researched methods include the Gaussian elimination method, the CVP algorithm, and various newly developed iterative techniques. By comparing the methods, we found that it is best to use the newly developed …moreAbstract:
Cieľom bakalárskej práce je preskúmať možnosti vylepšenia BoolTestu pomocou aproximácie boolovských funkcií. Za týmto účelom sme preskúmali rôzne metódy aproximácie boolovských funkcií. Medzi skúmané metódy patria Gaussova eliminačná metóda, CVP algoritmus a rôzne typy novovyvinutej iteratívnej techniky. Porovnaním metód sme zistili, že pre vylepšenie BoolTestu je najvhodnejšie použiť novovyvinutú …more
Language used: Slovak
Date on which the thesis was submitted / produced: 25. 5. 2021
Identifier:
https://is.muni.cz/th/z8bpx/
Thesis defence
- Date of defence: 29. 6. 2021
- Supervisor: Mgr. Marek Sýs, Ph.D.
- Reader: RNDr. Dušan Klinec
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Applied Informatics / Applied Informatics
Theses on a related topic
- No theses on a related topic available.