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

DOI10.1007/BF00289238zbMATH Open0543.94016OpenAlexW2018363637MaRDI QIDQ796492FDOQ796492

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

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

zbMATH Keywords

combinational circuitsAND functionNOR functionsimultaneous computation of AND and NOR

Mathematics Subject Classification ID

Cites Work

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

Cited In (6)

• New lower bounds on circuit size of multi-output functions
• Title not available (Why is that?)
• A Tree Representation of Combinational Networks
• Results of the Synthesis of Optimal Networks of AND and OR Gates for Four-Variable Switching Functions
• Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
• 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)