The following pages link to (Q4526973):
Displaying 5 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817) (← links)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions (Q5098770) (← links)