Realization of Boolean formulas by uniform multiplexor and majority cascades

zbMATH Open0898.94021MaRDI QIDQ1390684FDOQ1390684

Authors: V. L. Artyukhov, A. A. Shalyto 

Publication date: 18 October 1998

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Recommendations

• Multiplexor method for realization of Boolean functions by circuits composed of arbitrary logical elements
• Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
• Publication:3470421
• On the complexity of realization of Boolean functions by formulas
• On the complexity of realization of the linear function by formulas over finite Boolean bases

zbMATH Keywords

Boolean formulasrealization of Boolean functionsMukhopadhyaya cascadeShannon expansion

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited In (5)

• Extensional Uniformity for Boolean Circuits
• Canonical Form and Synthesis of Cellular Cascades
• A Two-Rail Cascade Synthesis of Boolean Functions
• Multiplexor method for realization of Boolean functions by circuits composed of arbitrary logical elements
• Multifunctional logic modules consisting of elements with bilateral conductance

This page was built for publication: Realization of Boolean formulas by uniform multiplexor and majority cascades

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