An n3/2 lower bound on the monotone network complexity of the Boolean convolution

DOI10.1016/S0019-9958(83)80035-7zbMath0576.94029MaRDI QIDQ3698705

Jürgen Weiss

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

semidisjoint bilinear forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution ⋮ Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth ⋮ Unnamed Item ⋮ On Negations in Boolean Networks ⋮ On the complexity of slice functions

This page was built for publication: An n3/2 lower bound on the monotone network complexity of the Boolean convolution