Skip navigation
Please use this identifier to cite or link to this item:
Title: A heuristic method for bi-decomposition of partial Boolean functions
Authors: Pottosin, Y. V.
Поттосин, Ю. В.
Keywords: публикации ученых
Decomposition of Boolean functions
bicliques of graphs
ternary matrix
Issue Date: 2021
Publisher: Объединенный институт проблем информатики Национальной академии наук Беларуси, РБ
Citation: Pottosin, Y. V. A heuristic method for bi-decomposition of partial Boolean functions / Pottosin Y. V. // Танаевские чтения : доклады Девятой Международной научной конференции, Минск, 30 марта 3021 г. – Минск : ОИПИ НАН Беларуси, 2021. – С. 169–173.
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.
Appears in Collections:Публикации в изданиях Республики Беларусь

Files in This Item:
File Description SizeFormat 
Pottosin_A.pdf66,76 kBAdobe PDFView/Open
Show full item record

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.