On small depth threshold circuits
From MaRDI portal
Recommendations
Cites work
- Constant Depth Reducibility
- Constant depth circuits, Fourier transform, and learnability
- Depth efficient neural networks for division and related problems
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
- Harmonic Analysis of Polynomial Threshold Functions
- Log Depth Circuits for Division and Related Problems
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Majority gates vs. general weighted threshold gates
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- On the Power of Threshold Circuits with Small Weights
- On the power of small-depth threshold circuits
- Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms
- Some notes on threshold circuits, and multiplication in depth 4
- The complexity of computations by networks
- Threshold circuits of bounded depth
Cited in
(12)- Threshold circuits of small majority-depth
- Circuit complexity before the dawn of the new millennium
- Powering requires threshold depth 3
- String Matching: Communication, Circuits, and Learning.
- On the power of small-depth threshold circuits
- A short list of equalities induces large sign-rank
- scientific article; zbMATH DE number 524117 (Why is no real title available?)
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- Circuit lower bounds from learning-theoretic approaches
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- Decomposition of threshold functions into bounded fan-in threshold functions
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
This page was built for publication: On small depth threshold circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056127)
