scientific article

zbMATH Open0621.94026MaRDI QIDQ3758728

Valdas Dičiūnas

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

monotone Boolean functionsmonotone switching circuitslinear combinational complexitymonotone networks

Mathematics Subject Classification ID

Recommendations

• Unnamed Item 👍 👎
• Comparator circuits over finite bounded posets 👍 👎
• Generalization of cardinality estimates for plane circuits realizing partial Boolean operators 👍 👎
• Computing the number of the equivalence classes for reversible logic functions 👍 👎
• Boolean circuits versus arithmetic circuits 👍 👎
• The complexity of the comparator circuit value problem 👍 👎
• Circuit Complexity and Multiplicative Complexity of Boolean Functions 👍 👎
• Mathematical Foundations of Computer Science 2003 👍 👎
• THE LOGIC OF COMPARATIVE CARDINALITY 👍 👎

This page was built for publication: