On small depth threshold circuits
From MaRDI portal
Publication:5056127
DOI10.1007/3-540-55706-7_4zbMath1502.68121OpenAlexW1578042930MaRDI QIDQ5056127
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_4
Related Items (9)
\(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom ⋮ Powering requires threshold depth 3 ⋮ Circuit lower bounds from learning-theoretic approaches ⋮ A Short List of Equalities Induces Large Sign-Rank ⋮ Decomposition of threshold functions into bounded fan-in threshold functions ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ String Matching: Communication, Circuits, and Learning. ⋮ Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates ⋮ Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
Cites Work
- On the power of small-depth threshold circuits
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Some notes on threshold circuits, and multiplication in depth 4
- Majority gates vs. general weighted threshold gates
- Threshold circuits of bounded depth
- Constant depth circuits, Fourier transform, and learnability
- Constant Depth Reducibility
- Harmonic Analysis of Polynomial Threshold Functions
- Log Depth Circuits for Division and Related Problems
- The complexity of computations by networks
- On the Power of Threshold Circuits with Small Weights
- Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
- Depth efficient neural networks for division and related problems
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
This page was built for publication: On small depth threshold circuits
