Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/46002
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPottosin, Y. V.-
dc.contributor.authorПоттосин, Ю. В.-
dc.date.accessioned2021-11-25T05:56:31Z-
dc.date.available2021-11-25T05:56:31Z-
dc.date.issued2021-
dc.identifier.citationPottosin, Y. V. A heuristic method for bi-decomposition of partial Boolean functions / Pottosin Y. V. // Танаевские чтения : доклады Девятой Международной научной конференции, Минск, 30 марта 3021 г. – Минск : ОИПИ НАН Беларуси, 2021. – С. 169–173.ru_RU
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/46002-
dc.description.abstractThe 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.isoenru_RU
dc.publisherОбъединенный институт проблем информатики Национальной академии наук Беларуси, РБru_RU
dc.subjectпубликации ученыхru_RU
dc.subjectDecomposition of Boolean functionsru_RU
dc.subjectbicliques of graphsru_RU
dc.subjectternary matrixru_RU
dc.titleA heuristic method for bi-decomposition of partial Boolean functionsru_RU
dc.typeСтатьяru_RU
Appears in Collections:Публикации в изданиях Республики Беларусь

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


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