An n3/2 lower bound on the monotone network complexity of the Boolean convolution
From MaRDI portal
Publication:3698705
DOI10.1016/S0019-9958(83)80035-7zbMath0576.94029MaRDI QIDQ3698705
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
Unnamed Item, On the complexity of slice functions, Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth, Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution, On Negations in Boolean Networks