Computing Boolean functions by polynomials and threshold circuits
From MaRDI portal
(Redirected from Publication:1293360)
Recommendations
Cited in
(23)- Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
- The hardest halfspace
- Algorithmic Polynomials
- A characterization of 2-threshold functions via pairs of prime segments
- Approximate degree and the complexity of depth three circuits
- The power of asymmetry in constant-depth circuits
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$
- Threshold circuits detecting global patterns in two-dimensional maps
- A short list of equalities induces large sign-rank
- Algorithms for synthesis of polynomials implementing weakly specified Boolean functions and systems
- New degree bounds for polynomial threshold functions
- Asymptotics of the number of 2-threshold functions
- On PAC learning algorithms for rich Boolean function classes
- Degree-uniform lower bound on the weights of polynomials with given sign function
- Polynomial threshold functions and Boolean threshold circuits
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- Polynomial threshold functions and Boolean threshold circuits
- Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- scientific article; zbMATH DE number 774000 (Why is no real title available?)
- Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
- Learning unions of (1)-dimensional rectangles
- Polynomial threshold functions, hyperplane arrangements, and random tensors
This page was built for publication: Computing Boolean functions by polynomials and threshold circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293360)
