Abstract: An original heuristic algorithm of sequential two-block decomposition of partial Boolean functions is researched. The key combinatorial task is considered: finding of suitable partition on the set of arguments, i. e. such one, on which the function is separable. The search for suitable partition is essentially accelerated by preliminary detection of its traces. Within the framework of the experimental system the efficiency of the algorithm is evaluated, the boundaries of its practical application are determined.

Keywords: Partial Boolean Functions, Heuristic Method of Decomposition

ACM Classification Keywords: B.6. Combinational logic, switching theory, automatic synthesis, optimization.

Link:

IMPLEMENTATION OF A HEURISTIC METHOD OF DECOMPOSITION OF PARTIAL BOOLEAN FUNCTIONS

Arkadij Zakrevskij, Nikolai Toropov

http://www.foibg.com/ibs_isc/ibs-01/IBS-01-p08.pdf