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: | , |
|---|---|
| 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 |
| Summary: | 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 circuit complexity point of view, and finding a solution as quickly as possible, if the system is decomposable. The results of computer experiment for determining decomposability of systems of Boolean functions are given. |
|---|---|
| ISSN: | 1816-0301 |