A new lower bound on the monotone network complexity of Boolean sums
From MaRDI portal
Publication:1137007
DOI10.1007/BF00263988zbMath0427.94033MaRDI QIDQ1137007
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
\(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice ⋮ Boolean functions whose monotone complexity is of size \(n^ 2\) / log n ⋮ On Negations in Boolean Networks ⋮ A very simple function that requires exponential size read-once branching programs. ⋮ Cancellation-free circuits in unbounded and bounded depth ⋮ An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution ⋮ Lower bounds on monotone complexity of the logical permanent
This page was built for publication: A new lower bound on the monotone network complexity of Boolean sums
