On Optimal Depth Threshold Circuits for Multiplication and Related Problems
From MaRDI portal
Publication:4296522
DOI10.1137/S0895480192228619zbMath0822.68034MaRDI QIDQ4296522
Kai-Yeung Siu, Vwani P. Roychowdhury
Publication date: 9 October 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480192228619
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
A new theorem in threshold logic and its application to multioperand binary adders, New algorithms and lower bounds for circuits with linear threshold gates, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, On small depth threshold circuits, On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, On the power of a threshold gate at the top, Decomposition of threshold functions into bounded fan-in threshold functions, Powering requires threshold depth 3, Threshold circuits of small majority-depth, Efficient threshold circuits for power series, Uniform constant-depth threshold circuits for division and iterated multiplication., Cryptographic hardness for learning intersections of halfspaces