Efficient threshold circuits for power series

DOI10.1006/INCO.1998.2783zbMATH Open1009.68061OpenAlexW2062725238MaRDI QIDQ1854292FDOQ1854292

Authors: Alexis Maciel, Denis Thérien 

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

Recommendations

• Approximating threshold circuits by rational functions
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• On the power of small-depth threshold circuits
• scientific article; zbMATH DE number 773998
• Threshold circuits of small majority-depth

zbMATH Keywords

depth-three circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Majority gates vs. general weighted threshold gates
• On Optimal Depth Threshold Circuits for Multiplication and Related Problems
• On ACC
• Threshold circuits of bounded depth
• Title not available (Why is that?)
• Depth efficient neural networks for division and related problems
• Threshold circuits of small majority-depth
• Log Depth Circuits for Division and Related Problems
• On Threshold Circuits and Polynomial Computation
• Title not available (Why is that?)

Cited In (6)

• 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\)
• Logarithmic Depth Circuits for Algebraic Functions

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)