Pages that link to "Item:Q1327392"
From MaRDI portal
The following pages link to Exponential size lower bounds for some depth three circuits (Q1327392):
Displaying 15 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition (Q1095871) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- A note on a theorem of Barrington, Straubing and Thérien (Q1351160) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields. (Q1573765) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- Improved Bounds for Reduction to Depth 4 and Depth 3 (Q2849964) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)
- (Q5111162) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
