prošireni sažetak izlaganja sa skupa
The key step in the application of BDDs is a variable order for Shannon expansion which allows efficient operations with Boolean functions, e.g., their minimization. As it was shown in the example, the minimization of Boolean functions can be used to produce optimal digital circuits for the implementation of an important class of cryptographic functions. In addition to that, this topic presents open problems for further research in the field of combinatorial optimizations, such as variable ordering in Shannon expansion and set covering problem. It is also important to mention that the properties of Boolean (Bent) functions can be further elaborated by research on graph properties of BDDs and their variants.
Boolean functions, DNF, BDD
Razvojem virtualizacijskih tehnologija raste kompleksnost IT sustava, dok korisnici istovremeno zahtijevaju brži pristup resursima, napredne integracije i jednostavnost korištenja. Jedno od ključnih rješenja za ove izazove primjena je…
Ovaj rad istražuje i uspoređuje mogućnosti prosljeđivanja grafičkih kartica na Hyper-V i KVM hipervizorima prema virtualnim strojevima, detaljno opisujući metode, postupke i razlike u arhitekturi koje utječu na…
The ever-growing usage and adaptation of HTTP/3 in web traffic leverages Quick UDP Internet Connections (QUIC) as a transport protocol. QUIC is widely recognized for reduced latency, enhanced…
