Please use this identifier to cite or link to this item:
https://libeldoc.bsuir.by/handle/123456789/37287
| Title: | On bi-decomposition of incompletely specified Boolean functions |
| Authors: | Pottosin, Yu. V. |
| Keywords: | материалы конференций;bi-decomposition;incompletely specified |
| Issue Date: | 2019 |
| Publisher: | БГУИР |
| Citation: | Pottosin, Yu. V. On bi-decomposition of incompletely specified Boolean functions / Yu. V. Pottosin // Информационные технологии и системы 2019 (ИТС 2019) = Information Teсhnologies and Systems 2019 (ITS 2019) : материалы международной научной конференции, Минск, 30 октября 2019 г. / Белорусский государственный университет информатики и радиоэлектроники ; редкол. : Л. Ю. Шилин [и др.]. – Минск, 2019. – С. 144–145. |
| Abstract: | A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. The problem of
bi-decomposition is reduced to the problem of a weighted two-block covering the edge set of the orthogonality graph
of the truth table rows by complete bipartite subgraphs (bicliques). Every biclique is assigned with a set of variables
in a definite way. The weight of a biclique is the size of that set. According to each biclique of the obtained cover,
a Boolean function is constructed whose arguments are the variables from the assigned set. |
| URI: | https://libeldoc.bsuir.by/handle/123456789/37287 |
| Appears in Collections: | ИТС 2019
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
