Pages that link to "Item:Q4296522"
From MaRDI portal
The following pages link to On Optimal Depth Threshold Circuits for Multiplication and Related Problems (Q4296522):
Displaying 12 items.
- On the power of a threshold gate at the top (Q287188) (← links)
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- A new theorem in threshold logic and its application to multioperand binary adders (Q4467334) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- On small depth threshold circuits (Q5056127) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
