scientific article; zbMATH DE number 1559525
From MaRDI portal
Publication:4526973
Recommendations
- Exponential lower bounds for depth three Boolean circuits
- The complexity of depth-3 circuits computing symmetric Boolean functions
- Exponential size lower bounds for some depth three circuits
- Upper and lower bounds for some depth-3 circuit classes
- Exponential lower bound for bounded depth circuits with few threshold gates
Cited in
(21)- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Exponential size lower bounds for some depth three circuits
- Upper and lower bounds for some depth-3 circuit classes
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Exponential lower bounds for depth three Boolean circuits
- Which problems have strongly exponential complexity?
- Subset sum ``cubes and the complexity of primality testing
- Top-down lower bounds for depth-three circuits
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- Bounds on an exponential sum arising in Boolean circuit complexity
- The complexity of DNF of parities
- A lower bound for depth-3 circuits with MOD m gates
- Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
- scientific article; zbMATH DE number 3937107 (Why is no real title available?)
- Exponential lower bound for bounded depth circuits with few threshold gates
- Approximate degree and the complexity of depth three circuits
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
- Near-optimal small-depth lower bounds for small distance connectivity
- Depth-three circuits for inner product and majority functions
- Circuit depth reductions
- The complexity of depth-3 circuits computing symmetric Boolean functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4526973)
