On Optimal Depth Threshold Circuits for Multiplication and Related Problems
From MaRDI portal
Publication:4296522
Recommendations
Cited in
(20)- Cryptographic hardness for learning intersections of halfspaces
- On the computational power of depth-2 circuits with threshold and modulo gates
- 2-1 addition and related arithmetic operations with threshold logic
- Threshold circuits of small majority-depth
- Powering requires threshold depth 3
- Threshold Circuits for Iterated Matrix Product and Powering
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- On the power of a threshold gate at the top
- On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
- Efficient threshold circuits for power series
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- Fast and Efficient Circuit Topologies forFinding the Maximum of n k-Bit Numbers
- Depth-efficient threshold circuits for multiplication and symmetric function computation
- On realizing iterated multiplication by small depth threshold circuits
- A new theorem in threshold logic and its application to multioperand binary adders
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- On the size of depth-two threshold circuits for the inner product mod 2 function
- On small depth threshold circuits
- Decomposition of threshold functions into bounded fan-in threshold functions
- scientific article; zbMATH DE number 773998 (Why is no real title available?)
This page was built for publication: On Optimal Depth Threshold Circuits for Multiplication and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296522)