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

DOI10.1023/B:AIRE.0000006606.01771.8fzbMath1060.94052OpenAlexW2131527561MaRDI QIDQ704639

Bernd Steinbach, Christian 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)

Related Items (3)

Algorithmic issues of AND-decomposition of Boolean formulas ⋮ The complexity of AND-decomposition of Boolean functions ⋮ AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables

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