Complexity of Monotone Networks for Computing Conjunctions
From MaRDI portal
Publication:4163136
DOI10.1016/S0167-5060(08)70326-1zbMath0383.94038OpenAlexW1495932320MaRDI QIDQ4163136
Publication date: 1978
Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70326-1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
\(\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 ⋮ Improved algorithms for the multicut and multiflow problems in rooted trees ⋮ Approximability of minimum AND-circuits ⋮ An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution ⋮ A faster computation of the most vital edge of a shortest path
This page was built for publication: Complexity of Monotone Networks for Computing Conjunctions
