Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition

DOI10.1023/B:AIRE.0000006606.01771.8FMaRDI QIDQ704639zbMATH OpenOpenAlexFDO

Authors Bernd Steinbach, Christian B. Lang

Publication date 19 January 2005

Published in Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:aire.0000006606.01771.8f

zbMATH Keywords

latticeareadelayBoolean functionbi-decompositionBoolean differential calculusderivative operationmulti-level circuit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Boolean functions (06E30)

Recommendations

• Bi-decomposition of function sets in multiple-valued logic for circuit design and data mining
• A method for bi-decomposition of partial Boolean functions
• Decomposition of multi-output Boolean functions
• Decomposition of Boolean functions applying the apparatus of Boolean derivatives
• Bi-decomposition of multi-valued logical functions and its applications

Cited in

(7)

• Bi-decomposition of function sets in multiple-valued logic for circuit design and data mining
• Algorithmic issues of AND-decomposition of Boolean formulas
• A method for bi-decomposition of partial Boolean functions
• Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
• AND-decomposition of Boolean polynomials with prescribed shared variables
• The complexity of AND-decomposition of Boolean functions
• Bi-decomposition of multi-valued logical functions and its applications

This page was built for publication: Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition

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