On the Power of Threshold Circuits with Small Weights
From MaRDI portal
Publication:3979443
Recommendations
Cited in
(24)- On the power of small-depth threshold circuits
- 2-1 addition and related arithmetic operations with threshold logic
- Impossibility results for weak threshold networks
- scientific article; zbMATH DE number 774001 (Why is no real title available?)
- Neural networks and complexity theory
- Correlation bounds for poly-size \(\mathrm{AC}^0\) circuits with \(n^{1 - o(1)}\) symmetric gates
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\)
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- The hardest halfspace
- A weak version of the Blum, Shub, and Smale model
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- Decomposition of threshold functions into bounded fan-in threshold functions
- scientific article; zbMATH DE number 3313265 (Why is no real title available?)
- On small depth threshold circuits
- Threshold circuits of small majority-depth
- Majority gates vs. general weighted threshold gates
- A weight-size trade-off for circuits with MOD \(m\) gates
- Evaluating spectral norms for constant depth circuits with symmetric gates
- A short list of equalities induces large sign-rank
- A note on neural sorting networks with O(1) time complexity
- Powering requires threshold depth 3
- On the Power of Threshold Measurements as Oracles
- Computing majority by constant depth majority circuits with low fan-in gates
- A note on the simulation of exponential threshold weights
This page was built for publication: On the Power of Threshold Circuits with Small Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979443)
