scientific article; zbMATH DE number 4008288

zbMATH Open0621.94026MaRDI QIDQ3758728FDOQ3758728

Authors: Valdas Dičiūnas 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• Comparator circuits over finite bounded posets
• Generalization of cardinality estimates for plane circuits realizing partial Boolean operators
• Circuit complexity and multiplicative complexity of Boolean functions
• Computing the number of the equivalence classes for reversible logic functions
• The logic of comparative cardinality
• scientific article; zbMATH DE number 2196509
• Mathematical Foundations of Computer Science 2003
• Boolean circuits versus arithmetic circuits
• The complexity of the comparator circuit value problem

zbMATH Keywords

monotone Boolean functionsmonotone switching circuitslinear combinational complexitymonotone networks

Mathematics Subject Classification ID

Cited In (1)

• Comparator circuits over finite bounded posets

This page was built for publication:

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