Pages that link to "Item:Q3979443"

The following pages link to On the Power of Threshold Circuits with Small Weights (Q3979443):

Displaying 22 items.

• Impossibility results for weak threshold networks (Q287142) (← links)
• A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
• Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• On the power of small-depth threshold circuits (Q685717) (← links)
• Powering requires threshold depth 3 (Q845974) (← links)
• Majority gates vs. general weighted threshold gates (Q1210330) (← links)
• Threshold circuits of small majority-depth (Q1273878) (← links)
• A note on neural sorting networks with O(1) time complexity (Q1352092) (← links)
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions (Q1802063) (← links)
• Evaluating spectral norms for constant depth circuits with symmetric gates (Q1904669) (← links)
• Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\) (Q1918950) (← links)
• The hardest halfspace (Q1983325) (← links)
• Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
• A weight-size trade-off for circuits with MOD \(m\) gates (Q2817598) (← links)
• Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
• On small depth threshold circuits (Q5056127) (← links)
• A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
• Neural networks and complexity theory (Q5096819) (← links)
• On the Power of Threshold Measurements as Oracles (Q5300906) (← links)
• (Q5593657) (← links)
• Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)