scientific article

zbMATH Open0621.94026MaRDI QIDQ3758728FDOQ3758728

Valdas Dičiūnas

Publication date: 1985

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

zbMATH Keywords

monotone Boolean functionsmonotone switching circuitslinear combinational complexitymonotone networks

Mathematics Subject Classification ID

Cited In (1)

• Comparator circuits over finite bounded posets

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Mathematical Foundations of Computer Science 2003 👍 👎
• Boolean circuits versus arithmetic circuits 👍 👎
• The complexity of the comparator circuit value problem 👍 👎

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)