BulDML at Institute of Mathematics and Informatics >
International Journal ITA >
2008 >
Volume 15 Number 3 >

Please use this identifier to cite or link to this item:

Title: Recognizing Decomposition of a Partial Boolean Function
Authors: Zakrevskij, Arkadij
Keywords: Partial Boolean function
non-disjunctive decomposition
weak partition
search by traces
recognition 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.
ISSN: 1313-0463
Appears in Collections:Volume 15 Number 3

Files in This Item:

File Description SizeFormat
ijita15-3-p10.pdf112.34 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License