Powering requires threshold depth 3
From MaRDI portal
Publication:845974
DOI10.1016/J.IPL.2006.11.003zbMATH Open1184.68269OpenAlexW2050739958MaRDI QIDQ845974FDOQ845974
Authors: Alexander A. Sherstov 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.003
Recommendations
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Threshold circuits of small majority-depth
- Upper and lower bounds for some depth-3 circuit classes
- On the power of small-depth threshold circuits
- On the computational power of depth 2 circuits with threshold and modulo gates
Cites Work
- The expressive power of voting polynomials
- Majority gates vs. general weighted threshold gates
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Threshold circuits of bounded depth
- Title not available (Why is that?)
- Depth efficient neural networks for division and related problems
- On the Power of Threshold Circuits with Small Weights
- Simulating Threshold Circuits by Majority Circuits
- On small depth threshold circuits
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
Cited In (6)
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Threshold Circuits for Iterated Matrix Product and Powering
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- The unbounded-error communication complexity of symmetric functions
- Circuit complexity of powering in fields of odd characteristic
- Hilbert's thirteenth problem and circuit complexity
This page was built for publication: Powering requires threshold depth 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845974)
