A heuristic method for bi-decomposition of partial Boolean functions

The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function. The bi-decomposition represents a given function as a logic algebra operation, wh...

ver descrição completa

Detalhes bibliográficos

Autor principal:	Yu. V. Pottosin
Formato:	Artigo
Idioma:	Russo
Publicado em:	National Academy of Sciences of Belarus, the United Institute of Informatics Problems 2020-09-01
coleção:	Informatika
Assuntos:	partial boolean function boolean function bi-decomposition superposition of functions logic algebra operations covering problem complete bipartite subgraph heuristic method
Acesso em linha:	https://inf.grid.by/jour/article/view/1072
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!