On an algorithm for constructing reduced DNF of order-prominent boolean functions
Saved in:
| Date: | 2019 |
|---|---|
| Main Author: | A. I. Timoshkin |
| Format: | Article |
| Language: | English |
| Published: |
2019
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000947553 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional boolean knapsack problem
by: S. V. Chupov
Published: (2018) -
The approximate algorithm of parallel lexicographical search for the multidimensional boolean knapsack problem with a fixed ordering of variables
by: S. V. Chupov
Published: (2017) -
Parallel algorithms for solving the boolean quadratic programming problem
by: V. P. Shylo, et al.
Published: (2015) -
Matrix characterization of symmetry groups of boolean functions
by: Jasionowski, Pawel
Published: (2018) -
Matrix characterization of symmetry groups of boolean functions
by: P. Jasionowski
Published: (2012)