Maximum MBF Types

Tkachenco V.G., Sinyavsky O.V. · Computer Science and Information Technology · 2018

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.

Read the paper · More papers on PaperTik