Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
From MaRDI portal
Publication:672256
DOI10.1016/0020-0190(95)00137-2zbMATH Open0875.94139OpenAlexW1980226746MaRDI QIDQ672256FDOQ672256
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00137-2
Recommendations
- Mathematical Foundations of Computer Science 2005
- scientific article; zbMATH DE number 773998
- On the computational power of depth-2 circuits with threshold and modulo gates
- On the computational power of depth 2 circuits with threshold and modulo gates
- Threshold circuits of bounded depth
- Threshold circuits of small majority-depth
- On the power of small-depth threshold circuits
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
- The complexity of depth-3 circuits computing symmetric Boolean functions
- Exponential lower bound for bounded depth circuits with few threshold gates
Cites Work
- \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
- Title not available (Why is that?)
- Top-down lower bounds for depth-three circuits
- On small depth threshold circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pi-sigma-pi threshold formulas
Cited In (5)
This page was built for publication: Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672256)
