Application of Election Functions to Estimate the Number of Monotone Self-Dual Boolean functions
One of the problems of modern discrete mathematics is R. Dedekind problem on the number of monotone boolean functions. For other precomplete classes, general formulas for the number of functions of the classes had been found, but it has not been found so far for the class of monotone boolean functio...
Saved in:
| Main Authors: | Leonid Y. Bystrov, Egor V. Kuzmin |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2022-06-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1647 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01) -
Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization
by: P. N. Bibilo, et al.
Published: (2024-12-01) -
The search for subsystems of related functions from multilevel representation of systems of Boolean functions1
by: P. N. Bibilo, et al.
Published: (2020-03-01) -
A heuristic method for multi-block parallel decomposition of a system of partial Boolean functions
by: Yu. V. Pottosin
Published: (2018-12-01) -
A method for bi-decomposition of partial Boolean functions
by: Yu. V. Pottosin
Published: (2019-12-01)