Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Depth efficient neural networks for division and related problems

Published: 01 May 1993 Publication History
  • Get Citation Alerts
  • Abstract

    An artificial neural network (ANN) is commonly modeled by a threshold circuit, a network of interconnected processing units called linear threshold gates. It is shown that ANNs can be much more powerful than traditional logic circuits, assuming that each threshold gate can be built with a cost that is comparable to that of AND/OR logic gates. In particular, the main results indicate that powering and division can be computed by polynomial-size ANNs of depth 4, and multiple product can be computed by polynomial-size ANNs of depth 5. Moreover, using the techniques developed, a previous result can be improved by showing that the sorting of n n -bit numbers can be carried out in a depth-3 polynomial-size ANN. Furthermore, it is shown that the sorting network is optimal in depth

    Cited By

    View all

    Index Terms

    1. Depth efficient neural networks for division and related problems
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image IEEE Transactions on Information Theory
      IEEE Transactions on Information Theory  Volume 39, Issue 3
      May 1993
      394 pages

      Publisher

      IEEE Press

      Publication History

      Published: 01 May 1993

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 12 Aug 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2016)Visual learning of arithmetic operationsProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016387.3016429(3733-3739)Online publication date: 12-Feb-2016
      • (2016)Collapse of the Hierarchy of Constant-Depth Exact Quantum CircuitsComputational Complexity10.1007/s00037-016-0140-025:4(849-881)Online publication date: 1-Dec-2016
      • (2014)New algorithms and lower bounds for circuits with linear threshold gatesProceedings of the forty-sixth annual ACM symposium on Theory of computing10.1145/2591796.2591858(194-202)Online publication date: 31-May-2014
      • (2013)A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depthQuantum Information & Computation10.5555/2535639.253564213:11-12(937-962)Online publication date: 1-Nov-2013
      • (2012)Design tools for artificial nervous systemsProceedings of the 49th Annual Design Automation Conference10.1145/2228360.2228490(717-722)Online publication date: 3-Jun-2012
      • (2009)Energy complexity and depth of threshold circuitsProceedings of the 17th international conference on Fundamentals of computation theory10.5555/1789494.1789526(335-345)Online publication date: 2-Sep-2009
      • (2007)Small depth quantum circuitsACM SIGACT News10.1145/1272729.127273938:2(35-50)Online publication date: 1-Jun-2007
      • (2005)Bounds on the power of constant-depth quantum circuitsProceedings of the 15th international conference on Fundamentals of Computation Theory10.1007/11537311_5(44-55)Online publication date: 17-Aug-2005
      • (2004)Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM10.1145/972639.97264351:2(231-262)Online publication date: 1-Mar-2004
      • (2003)Quantum Circuits with Unbounded Fan-outProceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science10.5555/646517.696323(234-246)Online publication date: 27-Feb-2003
      • Show More Cited By

      View Options

      View options

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media