Partial Boolean function non-disjunctive decomposition weak partition search by traces recognition of solution
Institute of Information Theories and Applications FOI ITHEA
A hard combinatorial problem is investigated which has useful application in design of discrete devices:
the two-block decomposition of a partial Boolean function. The key task is regarded: finding such a weak partition
on the set of arguments, at which the considered function can be decomposed. Solving that task is essentially
speeded up by the way of preliminary discovering traces of the sought-for partition. Efficient combinatorial
operations are used by that, based on parallel execution of operations above adjacent units in the Boolean space.