Pages that link to "Item:Q1346613"
From MaRDI portal
The following pages link to When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613):
Displaying 14 items.
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- The communication complexity of addition (Q519955) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← 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)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
