Pages that link to "Item:Q2365817"
From MaRDI portal
The following pages link to \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom (Q2365817):
Displaying 20 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Depth reduction for circuits of unbounded fan-in (Q1333269) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- (Q4612487) (← links)
- Pi-sigma-pi threshold formulas (Q4887487) (← links)
- (Q5009555) (← links)
- On the relationship between energy complexity and other Boolean function measures (Q5918744) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
