Harmonic Analysis of Polynomial Threshold Functions
From MaRDI portal
Recommendations
Cited in
(51)- A characterization of 2-threshold functions via pairs of prime segments
- Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
- Lower bounds for modular counting by circuits with modular gates
- scientific article; zbMATH DE number 7297102 (Why is no real title available?)
- Depth-efficient threshold circuits for multiplication and symmetric function computation
- Extremal properties of polynomial threshold functions
- scientific article; zbMATH DE number 2114156 (Why is no real title available?)
- A review of combinatorial problems arising in feedforward neural network design
- Separation results for Boolean function classes
- Minimal sign representation of Boolean functions: algorithms and exact results for low dimensions
- On the power of a threshold gate at the top
- Sign-representation of Boolean functions using a small number of monomials
- Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky
- Lower bounds for linear decision lists
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Polynomial threshold functions and Boolean threshold circuits
- Spectral properties of threshold functions
- Learning unions of \(\omega(1)\)-dimensional rectangles
- Asymptotics of the number of 2-threshold functions
- On XOR lemmas for the weight of polynomial threshold functions
- Polynomial threshold functions, hyperplane arrangements, and random tensors
- Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs
- The expressive power of voting polynomials
- An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}n
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- A note on the power of majority gates and modular gates
- Degree-uniform lower bound on the weights of polynomials with given sign function
- Polynomial threshold functions and Boolean threshold circuits
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- Learning fixed-dimension linear thresholds from fragmented data
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
- New degree bounds for polynomial threshold functions
- On small depth threshold circuits
- Threshold circuits of small majority-depth
- On the computational power of depth-2 circuits with threshold and modulo gates
- Bent functions and random Boolean formulas
- Self-predicting Boolean functions
- Majority gates vs. general weighted threshold gates
- Geometric arguments yield better bounds for threshold circuits and distributed computing
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- A Threshold Function for Harmonic Update
- Evaluating spectral norms for constant depth circuits with symmetric gates
- Bounds on the Fourier coefficients of the weighted sum function
- A short list of equalities induces large sign-rank
- Threshold circuit lower bounds on cryptographic functions
- Unconditional lower bounds for learning intersections of halfspaces
- Noise sensitivity of Boolean functions and applications to percolation
- scientific article; zbMATH DE number 7250146 (Why is no real title available?)
- Characterization of multiple-valued threshold functions in the Vilenkin-Chrestenson basis
- Learning with queries corrupted by classification noise
This page was built for publication: Harmonic Analysis of Polynomial Threshold Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472059)
