INVESTIGATION OF DECOMPOSABILITY OF A SYSTEM OF BOOLEAN FUNCTIONS
A computer program is described which analyzes the decomposability of a system of Boolean functions and searches for an appropriate partition of the argument set. Three tasks linked with a system of Boolean functions are given: producing all solutions, searching for the best solution from the circui...
Main Authors: | S. H. Taghavi Afshord, Yu. V. Pottosin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2016-10-01
|
Series: | Informatika |
Online Access: | https://inf.grid.by/jour/article/view/104 |
Similar Items
-
A method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2019-12-01) -
A METHOD FOR MULTI-BLOCK PARALLEL DECOMPOSITION OF A SYSTEM OF PARTIAL BOOLEAN FUNCTIONS
by: Yu. V. Pottosin
Published: (2017-10-01) -
A heuristic method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2020-09-01) -
A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions
by: Yu. V. Pottosin
Published: (2018-12-01) -
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
by: Yu. V. Pottosin
Published: (2022-03-01)