Pages that link to "Item:Q2366275"
From MaRDI portal
The following pages link to Threshold circuits of bounded depth (Q2366275):
Displayed 17 items.
- Estimation of certain exponential sums arising in complexity theory (Q556911) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- Uniqueness of optimal mod 3 polynomials for parity (Q962998) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- On the Computational Power of Threshold Circuits with Sparse Activity (Q3421380) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Testing (Subclasses of) Halfspaces (Q4933385) (← links)