Abstract
A special class of monotone Boolean functions coming from shadow minimization theory of finite set-systems – KK-MBF functions – is considered. These functions are a descriptive model for systems of compatible groups of constraints, however, the class of all functions is unambiguously complex and it is sensible to study relatively simple subclasses of functions such as KK-MBF. Zeros of KK-MBF functions correspond to initial segments of lexicographic order on hypercube layers. This property is used to simplify the recognition. Lexicographic order applies priorities over constraints which is applicable property of practices. Query-based algorithms for KK-MBF functions are investigated in terms of their complexities.
Reference56 articles.
1. The discrete isoperimetry problem and related extremal problems for discrete spaces;Problemy Kibernetiki,1979
2. The splitting technique in monotone recognition;Discrete Applied Mathematics,2017
3. Large Network Target Coverage Protocols
4. Target class classification recursion preliminaries;Baltic Journal of Modern Computing,2023