National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
Library for Boolean Functions in Algebraic Normal Form
Vasilišin, Maroš ; Mrázek, Vojtěch (referee) ; Dobai, Roland (advisor)
This bachelor thesis focuses on design and implementation of library in C language for manipulation od Boolean functions in Algebraic Normal Form. Majority of existing libraries for representation of Boolean functions is based on binary decision diagrams. Algebraic Normal Form presents several advantages over binary decision diagrams, for example Boolean value of function can be determined in linear time. Implemented library uses simple structures to effectively represent Boolean function in program. After experiments we determined that representation in Algebraic Normal Form has its applications, and in some cases it provides better results than representation in binary decision diagrams.
New Techniques for Compact Representation of Boolean Functions
Maťufka, Ján ; Holík, Lukáš (referee) ; Lengál, Ondřej (advisor)
Binárne rozhodovacie diagramy (BDD) reprezentujú Booleovské funkcie a sú značne využívané vo formálnej verifikácii, model checkingu, syntéze obvodov v CAD softvéroch, atď. S rastúcim počtom premenných ale (v najhoršom prípade) exponenciálne rastie aj veľkosť BDD. Cieľom tejto práce je vytvoriť kompaktný model reprezentácie Booleovských funkcií založený na automatoch. K dosiahnutiu tohto cieľa boli použité stromové automaty. Vkladaním stromových automatov so špeciálnymi vlastnosťami do štruktúry BDD je možné redukovať opakujúce sa vzory. Tento model dosiahol v priemere 10-20 % menšie počty uzlov v testovaných prípadoch v porovnaní so súčasnými modelmi. Používanie automatového prístupu umožňuje vytvárať vlastné automaty prispôsobené na redukciu konkrétnych vzorov, čím sa rozširujú možnosti tohto modelu a jeho potenciál na ešte lepšie výsledky.
Library for Boolean Functions in Algebraic Normal Form
Vasilišin, Maroš ; Mrázek, Vojtěch (referee) ; Dobai, Roland (advisor)
This bachelor thesis focuses on design and implementation of library in C language for manipulation od Boolean functions in Algebraic Normal Form. Majority of existing libraries for representation of Boolean functions is based on binary decision diagrams. Algebraic Normal Form presents several advantages over binary decision diagrams, for example Boolean value of function can be determined in linear time. Implemented library uses simple structures to effectively represent Boolean function in program. After experiments we determined that representation in Algebraic Normal Form has its applications, and in some cases it provides better results than representation in binary decision diagrams.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.