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-7zbMATH Open0576.94029MaRDI QIDQ3698705FDOQ3698705
Authors: Jürgen Weiss 
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Recommendations
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- scientific article; zbMATH DE number 3867233
- Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
- A 2.5 n lower bound on the monotone network complexity of \(T^ n_ 3\)
- scientific article
Cited In (6)
- Title not available (Why is that?)
- 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
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698705)
