Maximum MBF Types
Autor: | V G Tkachenco, O V Sinyavsky |
---|---|
Rok vydání: | 2018 |
Předmět: | |
Zdroj: | Computer Science and Information Technology. 6:47-53 |
ISSN: | 2331-6071 2331-6063 |
DOI: | 10.13189/csit.2018.060401 |
Popis: | The classification of monotone Boolean functions (MBF) into types is given. The notion of the maximum type of MBF is introduced, and the shift-sum types are constructed. The matrices of type distribution by rank are constructed. Convenient algorithms for finding the number of maximum types and the maximum types themselves are presented. The proposed methods can be used to analyze large MBF ranks. |
Databáze: | OpenAIRE |
Externí odkaz: |