A method for bi-decomposition of partial Boolean functions
The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions. Any of the required functions must have fewer arguments than the given funct...
Main Author: | Yu. V. Pottosin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
The United Institute of Informatics Problems of the National Academy of Sciences of Belarus
2019-12-01
|
Series: | Informatika |
Subjects: | |
Online Access: | https://inf.grid.by/jour/article/view/881 |
Similar Items
-
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) -
An Investigation of the Range of a Boolean Function
by: Eggert, Jr., Norman H.
Published: (1963) -
Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs
by: Juan A. Aledo, et al.
Published: (2020-10-01) -
On the Lyapunov Exponent of Monotone Boolean Networks <sup>†</sup>
by: Ilya Shmulevich
Published: (2020-06-01)