Pages that link to "Item:Q3503631"
From MaRDI portal
The following pages link to Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates (Q3503631):
Displaying 6 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements (Q3225912) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
