Efficient monotone circuits for threshold functions

DOI10.1016/0020-0190(89)90011-2zbMath0675.94023OpenAlexW2004365288MaRDI QIDQ1122560

Martin Kochol

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90011-2

zbMATH Keywords

Boolean functioncircuit complexitythreshold functionmonotone circuitsorting network

Mathematics Subject Classification ID

Related Items (3)

Lower bounds for Boolean circuits of bounded negation width ⋮ Comment on Kochol's paper ``Efficient monotone circuits for threshold functions ⋮ Lower Bounds for DeMorgan Circuits of Bounded Negation Width

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Bounds to Complexities of Networks for Sorting and for Switching
• Shifting Graphs and Their Applications
• An Improved Lower Bound for Sorting Networks

This page was built for publication: Efficient monotone circuits for threshold functions