naa a22 4500 510809723 CHVBK 20180411083436.0 cr unu---uuuuu 180411e20131101xx s 000 0 eng 10.1134/S106423071306004X doi (NATIONALLICENCE)springer-10.1134/S106423071306004X Bibilo P. Joint Institute of Informatics Problems, National Academy of Sciences, ul. Surganova 6, 220012, Minsk, Belarus aut Minimization of binary decision diagrams for systems of incompletely defined Boolean functions [Elektronische Daten] [P. Bibilo] Algorithms for minimizing multilevel representations of systems of incompletely defined Boolean functions for various initial functional forms are proposed. The multilevel representations are based on the Shannon decomposition. Results of experimental studies indicate that the proposed algorithms are efficient for synthesizing logic circuits of library elements. Pleiades Publishing, Ltd., 2013 Journal of Computer and Systems Sciences International Springer US; http://www.springer-ny.com 52/6(2013-11-01), 909-927 1064-2307 52:6<909 2013 52 11488 https://doi.org/10.1134/S106423071306004X text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1134/S106423071306004X text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Bibilo P. Joint Institute of Informatics Problems, National Academy of Sciences, ul. Surganova 6, 220012, Minsk, Belarus aut NATIONALLICENCE 773 0- Journal of Computer and Systems Sciences International Springer US; http://www.springer-ny.com 52/6(2013-11-01), 909-927 1064-2307 52:6<909 2013 52 11488 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer