Efficient threshold circuits for power series
From MaRDI portal
(Redirected from Publication:1854292)
Recommendations
Cites work
- scientific article; zbMATH DE number 4155875 (Why is no real title available?)
- scientific article; zbMATH DE number 3777779 (Why is no real title available?)
- Depth efficient neural networks for division and related problems
- Log Depth Circuits for Division and Related Problems
- Majority gates vs. general weighted threshold gates
- On ACC
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- On Threshold Circuits and Polynomial Computation
- Threshold circuits of bounded depth
- Threshold circuits of small majority-depth
Cited in
(6)- Logarithmic Depth Circuits for Algebraic Functions
- Root finding with threshold circuits
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Space Hardness of Solving Structured Linear Systems.
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\)
This page was built for publication: Efficient threshold circuits for power series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854292)