A 4n-lower bound on the monotone network complexity of a one-output Boolean function

DOI10.1016/0020-0190(84)90111-XzbMath0548.94040OpenAlexW2084152790MaRDI QIDQ800311

Jürgen Tiekenheinrich

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90111-x

zbMATH Keywords

Boolean functionmonotone network complexitythreshold-k-function

Mathematics Subject Classification ID

Related Items (3)

The monotone circuit complexity of Boolean functions ⋮ On Negations in Boolean Networks ⋮ Monotone circuit lower bounds from robust sunflowers

Cites Work

• Unnamed Item

This page was built for publication: A 4n-lower bound on the monotone network complexity of a one-output Boolean function