Depth efficient neural networks for division and related problems

DOI10.1109/18.256501MaRDI QIDQ4277152zbMATH OpenOpenAlexFDO

Authors Kai-Yeung Siu, Jehoshua Bruck, Thomas Hofmeister, T. 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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited in

(9)

• On the computational power of depth-2 circuits with threshold and modulo gates
• Threshold circuits of small majority-depth
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
• Efficient threshold circuits for power series
• Collapse of the hierarchy of constant-depth exact quantum circuits
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• On small depth threshold circuits
• Quantum complexity for discrete logarithms and related problems
• Powering requires threshold depth 3

This page was built for publication: Depth efficient neural networks for division and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277152)