| DC Field | Value | Language |
|---|
| dc.contributor.author | Pottosin, Y. V. | - |
| dc.date.accessioned | 2021-11-25T05:56:31Z | - |
| dc.date.available | 2021-11-25T05:56:31Z | - |
| dc.date.issued | 2021 | - |
| dc.identifier.citation | Pottosin, Y. V. A heuristic method for bi-decomposition of partial Boolean functions / Pottosin Y. V. // Танаевские чтения : доклады Девятой Международной научной конференции, Минск, 30 марта 3021 г. – Минск : ОИПИ НАН Беларуси, 2021. – С. 169–173. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/46002 | - |
| dc.description.abstract | The problem of bi-decomposition is reduced to search for a pair of complete bipartite subgraphs (bicliques) in an orthogonality graph of a ternary matrix that specifies a given function. Each biclique is assigned with a set of arguments of the given function. According to each of bicliques, a Boolean function is constructed whose arguments are the variables from the set, which is assigned to the biclique. The obtained functions form a solution of the bi-decomposition problem. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | Объединенный институт проблем информатики Национальной академии наук Беларуси | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | Decomposition of Boolean functions | ru_RU |
| dc.subject | bicliques of graphs | ru_RU |
| dc.subject | ternary matrix | ru_RU |
| dc.title | A heuristic method for bi-decomposition of partial Boolean functions | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | Публикации в изданиях Республики Беларусь
|
