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

DOI10.1007/BF00289238zbMath0543.94016OpenAlexW2018363637MaRDI QIDQ796492

Martin Seysen, Norbert Blum

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

Related Items

New lower bounds on circuit size of multi-output functions

Cites Work

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