Efficient threshold circuits for power series
From MaRDI portal
Publication:1854292
DOI10.1006/inco.1998.2783zbMath1009.68061OpenAlexW2062725238MaRDI QIDQ1854292
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1998.2783
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Space Hardness of Solving Structured Linear Systems. ⋮ Root finding with threshold circuits ⋮ Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Majority gates vs. general weighted threshold gates
- Threshold circuits of small majority-depth
- On ACC
- Threshold circuits of bounded depth
- Log Depth Circuits for Division and Related Problems
- On Threshold Circuits and Polynomial Computation
- Depth efficient neural networks for division and related problems
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
This page was built for publication: Efficient threshold circuits for power series
