Partial restoration of descreet systems with random access

It is suggested a compact representation of all possible boolean space's splittings. They are produced by using dichotomy trees with number of nodes from 1 to 2 , where m is a dimension of boolean space. The problem of descreet systems' partial restoration reduced to building special minimal reflection P. Minimality of the reflection achived with searching through dichotomy trees. Properties of subsets of system's correct elements can be used for reducing computational cost of the search.

Keywords

Authors

References