On the number of ANDs versus the number of ORs in monotone Boolean circuits

DOI10.1016/0020-0190(96)00080-4zbMath1048.94519OpenAlexW2034887851MaRDI QIDQ1847364

Uri Zwick

Publication date: 24 June 2003

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

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00080-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• The monotone circuit complexity of Boolean functions
• On the computational power of pushdown automata
• An Algorithm for the Computation of Linear Forms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of ANDs versus the number of ORs in monotone Boolean circuits