Degree-uniform lower bound on the weights of polynomials with given sign function
From MaRDI portal
Publication:2510769
DOI10.1134/S0081543811060149zbMath1358.94116OpenAlexW2010761108MaRDI QIDQ2510769
Publication date: 4 August 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543811060149
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the power of a threshold gate at the top
- Perceptrons of large weight
- Computing Boolean functions by polynomials and threshold circuits
- Perceptrons, PP, and the polynomial hierarchy
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Threshold circuits of bounded depth
- Harmonic Analysis of Polynomial Threshold Functions
- A Uniform Lower Bound on Weights of Perceptrons
- On the Size of Weights for Threshold Gates