On the power of a threshold gate at the top
From MaRDI portal
Publication:287188
DOI10.1016/S0020-0190(97)00141-5zbMath1336.94095MaRDI QIDQ287188
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length ⋮ Unnamed Item ⋮ New degree bounds for polynomial threshold functions ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Degree-uniform lower bound on the weights of polynomials with given sign function ⋮ Polynomial threshold functions and Boolean threshold circuits ⋮ Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Cites Work
- On the power of small-depth threshold circuits
- Majority gates vs. general weighted threshold gates
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- On the computational power of depth 2 circuits with threshold and modulo gates
- Harmonic Analysis of Polynomial Threshold Functions
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Real Analysis and Probability
This page was built for publication: On the power of a threshold gate at the top
