Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/74

 Title: Recognizing Decomposition of a Partial Boolean Function Authors: Zakrevskij, Arkadij Keywords: Partial Boolean functionnon-disjunctive decompositionweak partitionsearch by tracesrecognition of solution Issue Date: 2008 Publisher: Institute of Information Theories and Applications FOI ITHEA Abstract: 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. URI: http://hdl.handle.net/10525/74 ISSN: 1313-0463 Appears in Collections: Volume 15 Number 3

Files in This Item:

File Description SizeFormat