Characterization of all optimal networks for a simultaneous computation of AND and NOR

DOI10.1007/BF00289238MaRDI QIDQ796492zbMATHOpenAlexFDO

Authors Norbert Blum, Martin Seysen

Publication date 1984

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289238

zbMATH Keywords

combinational circuitsAND functionNOR functionsimultaneous computation of AND and NOR

Mathematics Subject Classification ID

Recommendations

• Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions
• On the synthesis of NAND or NOR networks having multi-level
• scientific article; zbMATH DE number 30276
• Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
• scientific article; zbMATH DE number 910735

Cites work

• A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
• Computational Work and Time on Finite Machines
• Realizing Boolean functions on disjoint sets of variables
• Relations Among Complexity Measures
• The combinational complexity of equivalence
• The network complexity and the Turing machine complexity of finite functions

Cited in

(6)

• A Tree Representation of Combinational Networks
• scientific article; zbMATH DE number 30276 (Why is no real title available?)
• New lower bounds on circuit size of multi-output functions
• Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
• Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions
• Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees

This page was built for publication: Characterization of all optimal networks for a simultaneous computation of AND and NOR

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