Depth efficient neural networks for division and related problems
From MaRDI portal
Publication:4277152
DOI10.1109/18.256501zbMath0942.68660OpenAlexW2139224092MaRDI QIDQ4277152
Kai-Yeung Siu, Thomas Hofmeister, Jehoshua Bruck, Thomas Kailath
Publication date: 14 August 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20120309-113620511
Related Items
On small depth threshold circuits ⋮ Powering requires threshold depth 3 ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ New algorithms and lower bounds for circuits with linear threshold gates ⋮ Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions ⋮ On the computational power of depth-2 circuits with threshold and modulo gates ⋮ Threshold circuits of small majority-depth ⋮ Efficient threshold circuits for power series