| DC Field | Value | Language |
|---|
| dc.contributor.author | Pottosin, Yu. V. | - |
| dc.date.accessioned | 2019-11-16T07:12:32Z | - |
| dc.date.available | 2019-11-16T07:12:32Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | Pottosin, Yu. V. On bi-decomposition of incompletely specified Boolean functions / Pottosin Yu. V. // Информационные технологии и системы 2019 (ИТС 2019) = Information Teсhnologies and Systems 2019 (ITS 2019) : материалы международной научной конференции, Минск, 30 октября 2019 г. / Белорусский государственный университет информатики и радиоэлектроники; редкол. : Л. Ю. Шилин [и др.]. – Минск, 2019. – С. 144 – 145. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/37287 | - |
| dc.description.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. | ru_RU |
| dc.language.iso | ru | ru_RU |
| dc.publisher | БГУИР | ru_RU |
| dc.subject | материалы конференций | ru_RU |
| dc.subject | bi-decomposition | ru_RU |
| dc.subject | incompletely specified | ru_RU |
| dc.title | On bi-decomposition of incompletely specified Boolean functions | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | ИТС 2019
|
