Pages that link to "Item:Q3588437"
From MaRDI portal
The following pages link to Learning and Lower Bounds for AC 0 with Threshold Gates (Q3588437):
Displayed 10 items.
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- The communication complexity of addition (Q519955) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← 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)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)