On Decomposition of Sub-definite Partial Boolean Functions

DOI10.17516/1997-1397-2016-9-1-119-122MaRDI QIDQ5852964zbMATH OpenOpenAlexFDO

Authors Ivan Konstantinovich Sharankhaev

Publication date 18 March 2021

Published in Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/jsfu466

zbMATH Keywords

decompositionsuperpositionincompletely defined Boolean functionsub-definite partial Boolean function

Mathematics Subject Classification ID

Functions of a complex variable (30-XX) General topology (54-XX)

Recommendations

• Decomposition of Boolean functions applying the apparatus of Boolean derivatives
• scientific article; zbMATH DE number 2059953
• A new approach to the decomposition of Boolean functions by the method of q-partitions. I: Separating decomposition of full and partial functions
• scientific article; zbMATH DE number 1498461
• A decomposition of Boolean functions

Cites work

• scientific article; zbMATH DE number 3644971 (Why is no real title available?)
• scientific article; zbMATH DE number 3089087 (Why is no real title available?)
• A completeness criterion for underdetermined partial Boolean functions
• Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.

Cited in

(9)

• scientific article; zbMATH DE number 1436990 (Why is no real title available?)
• scientific article; zbMATH DE number 5924797 (Why is no real title available?)
• scientific article; zbMATH DE number 1349221 (Why is no real title available?)
• scientific article; zbMATH DE number 5174795 (Why is no real title available?)
• scientific article; zbMATH DE number 4170973 (Why is no real title available?)
• A new approach to the decomposition of Boolean functions. IV. Non-disjoint decomposition: the method of \(p,q\)-partitions
• On read-once multifunctions in some base
• Decomposition of a system of incompletely specified Boolean functions defined with a binary decision diagram
• Use of partial substitutions for time decomposition of Boolean functions and generalized graph schemes of algorithms

This page was built for publication: On Decomposition of Sub-definite Partial Boolean Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5852964)