A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
From MaRDI portal
Publication:798294
DOI10.1007/BF00264232zbMath0545.94021OpenAlexW2320924696MaRDI QIDQ798294
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00264232
Related Items (2)
Comment on Kochol's paper ``Efficient monotone circuits for threshold functions ⋮ On the complexity of monotone circuits for threshold symmetric Boolean functions
This page was built for publication: A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
