Depth-Size Tradeoffs for Neural Computation

No abstract is available for this paper.

• Publication year

  1991

• Venue

  IEEE Trans. Computers

• Publication date

  1991-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/12.106225
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Depth efficient neural networks for division and related problems

  1993cited by this paper
• Computing With Almost Optimal Size Threshold Circuits

  1991influential reference
• A geometric approach to threshold circuit complexity

  1991cited by this paper
• Some Notes on Threshold Circuits, and Multiplication in Depth 4

  1991cited by this paper
• On The Power Of Threshold Circuits With Small Weights

  1991influential reference
• Neural computation of arithmetic functions

  1990cited by this paper
• On the Circuit Complexity of Neural Networks

  1990cited by this paper
• Polynomial threshold functions, AC functions and spectrum norms

  1990cited by this paper
• Harmonic Analysis of Polynomial Threshold Functions

  1990cited by this paper
• On threshold circuits for parity

  1990cited by this paper
• Constant depth circuits, Fourier transform, and learnability

  1989cited by this paper
• The complexity of Boolean functions

  1987cited by this paper
• The Complexity of Computations by Networks

  1987cited by this paper
• On Threshold Circuits and Polynomial Computation

  1987cited by this paper
• Threshold circuits of bounded depth

  1987cited by this paper
• Constant Depth Reducibility

  1984cited by this paper
• Log Depth Circuits for Division and Related Problems

  1984cited by this paper
• Unbounded fan-in circuits and associative functions

  1983cited by this paper
• Two problems in concrete complexity: cycle detection and parallel prefix computation

  1982cited by this paper
• Parity, circuits, and the polynomial-time hierarchy

  1981cited by this paper
• Parallel Prefix Computation

  1980cited by this paper
• Bounds to Complexities of Networks for Sorting and for Switching

  1975cited by this paper
• Synthesis of threshold circuits for certain classes of Boolean functions

  1970cited by this paper
• The Realization of Symmetric Switching Functions with Linear-Input Logical Elements

  1961cited by this paper
• Linear-Input Logic

  1961cited by this paper
• The principle of majority decision logical elements and the complexity of their circuits

  1959cited by this paper
• The synthesis of two-terminal switching circuits

  1949cited by this paper

• Adding numbers with spiking neural circuits on neuromorphic hardware: a building block for future hybrid systems

  2025cites this paper
• WL Tests Are Far from All We Need: Revisiting WL-Test Hardness and GNN Expressive Power from a Distributed Computation Perspective

  2024cites this paper
• Nearest Neighbor Representations of Neural Circuits

  2024cites this paper
• On the Information Capacity of Nearest Neighbor Representations

  2023cites this paper
• Big data processing with 1D-Crosspoint Arrays

  2023cites this paper
• FPGA IMPLEMENTATIONS OF NEURAL NETWORKS

  2023influential citation
• Provable Advantages for Graph Algorithms in Spiking Neural Networks

  2021cites this paper
• On the Compressive Power of Boolean Threshold Autoencoders

  2020cites this paper
• Mechanisms of competitive selection: A canonical neural circuit framework

  2020cites this paper
• Searching and Sorting with O(n2) processors in O(1) time

  2020cites this paper
• Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication

  2018cites this paper
• Deep networks are efficient for circular manifolds

  2016cites this paper
• Signal processing techniques and applications

  2015cites this paper
• An Improved Majority-Logic Decoder Offering Massively Parallel Decoding for Real-Time Control in Embedded Systems

  2013cites this paper
• On the correspondence between neural folding architectures and tree automata

  2013cites this paper
• Low-depth quantum architectures for factoring

  2013cites this paper
• Design tools for artificial nervous systems

  2012cites this paper
• Parity- N Problems as a Vehicle to Compare Efficiencies of Neural Network Architectures

  2011cites this paper
• Negative Difference Resistance and Its Application to Construct Boolean Logic Circuits

  2010cites this paper
• AN OVERVIEW OF NEURAL NETWORKS RESULTS FOR SYSTEMS AND CONTROL

  2009cites this paper
• Universal Perceptron and DNA-Like Learning Algorithm for Binary Neural Networks: Non-LSBF Implementation

  2009cites this paper
• Universal perceptron and DNA-like learning algorithm for binary neural networks

  2009cites this paper
• Using Threshold Functions in Teaching Electronics

  2008cites this paper
• A New Decomposition Algorithm for Threshold Synthesis and Generalization of Boolean Functions

  2008cites this paper
• ESDA 2008-59125 USING THRESHOLD FUNCTIONS IN TEACHING ELECTRONICS

  2008cites this paper
• Du parallélisme connexionniste à une pratique de calcul distribué numérique bio-inspiré

  2007cites this paper
• Low Weight and Fan-In Neural Networks for Basic Arithmetic Operations

  2007cites this paper
• On Serial Multiplication with Neural Networks

  2007cites this paper
• Computational capabilities of feedforward neural networks: the role of the output function

  2007cites this paper
• Signed Digit Counters with Neural Networks

  2007cites this paper
• FPGA Implementations of Neural Networks

  2006cites this paper
• Optimal Synthesis of Boolean Functions by Threshold Functions

  2006cites this paper
• Neural Network Architecture Selection: Size Depends on Function Complexity

  2006cites this paper
• FPNA: applications and implementations

  2006influential citation
• The influence of oppositely classified examples on the generalization complexity of Boolean functions

  2006cites this paper
• Generalization ability of Boolean functions implemented in feedforward neural networks

  2006cites this paper
• FPNA: Concepts and Properties

  2006cites this paper
• Role of Function Complexity and Network Size in the Generalization Ability of Feedforward Networks

  2005cites this paper
• On the Computational Power of Max-Min Propagation Neural Networks

  2004cites this paper
• Neural Networks and Soft Computing

  2003cites this paper
• Computation with Neural Networks : A Survey of Complexity Theoretic Results

  2003cites this paper
• On the Node Complexity of Threshold Gate Circuits with Sub-linear Fan-ins

  2003cites this paper
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results

  2003cites this paper
• Three-Dimensional Feedforward Neural Networks and Their Realization by Nano-Devices

  2003cites this paper
• On Existential and Constructive Neural Complexity Results

  2003cites this paper
• The influence of opposite examples and randomness on the generalization complexity of Boolean functions

  2003cites this paper
• Optimal practical adders using perceptrons

  2003cites this paper
• Solving parity-N problems with feedforward neural networks

  2003cites this paper
• Constructive Threshold Logic Addition A Synopsis of the Last Decade

  2003influential citation
• A survey of perceptron circuit complexity results

  2003cites this paper
• On the capabilities of neural networks using limited precision weights

  2002cites this paper
• On Optimal Computations Using Perceptrons

  2002cites this paper
• The word-level models for efficient computation of multiple-valued functions.2. LWL based model

  2002cites this paper
• On higher order noise immune perceptrons

  2001cites this paper
• Ultra-fast noise immune CMOS threshold logic gates

  2000cites this paper
• FPNA: Interaction Between FPGA and Neural Computation

  2000cites this paper
• Signed Digit Addition and Related Operations with Threshold Logic

  2000cites this paper
• Training digital circuits with Hamming clustering

  2000cites this paper
• An Architecture for Computing Zech's Logarithms in GF(2m)

  2000cites this paper
• Adaptive processing of structural data: from sequences to trees and beyond

  2000cites this paper
• Neural Addition and Fibonacci Numbers

  1999cites this paper
• Serial binary multiplication with feed-forward neural networks

  1999cites this paper
• On the implementation of frontier-to-root tree automata in recursive neural networks

  1999cites this paper
• A Constructive Approach to Calculating Lower Entropy Bounds

  1999cites this paper
• Two Operand Binary Adders with Threshold Logic

  1999cites this paper
• One Two operand Binary Adders with Threshold Logic

  1998cites this paper
• Threshold Circuits of Small Majority-Depth

  1998cites this paper
• Deeper Sparsely Nets can be Optimal

  1998cites this paper
• Periodic symmetric functions, serial addition, and multiplication with neural networks

  1998influential citation
• On Kolmogorov's superpositions and Boolean functions

  1998cites this paper
• Implementing size-optimal discrete neural networks require analog circuitry

  1998cites this paper
• On the circuit and VLSI complexity of threshold gate COMPARISON

  1998cites this paper
• On automatic synthesis of analog/digital circuits

  1998cites this paper
• Optimal neural computations require analog processors

  1998cites this paper
• Entropy Based Comparison of Neural Networks for Classification

  1998cites this paper
• How to build VLSI-efficient neural chips

  1998cites this paper
• When Reduced Connectivity Neural Nets Are Complexity Optimal

  1998cites this paper
• On sparsely connected optimal neural networks

  1997cites this paper
• Enhanced lower entropy bounds with application to constructive learning

  1997cites this paper
• On limited fan-in optimal neural networks

  1997cites this paper
• Deeper sparsely nets are size-optimal

  1997cites this paper
• When constants are important

  1997cites this paper
• Small fan-in is beautiful

  1997cites this paper
• Tight Bounds on the Size of Neural Networks for Classification Problems

  1997cites this paper
• On the Circuit Complexity of Sigmoid Feedforward Neural Networks

  1996cites this paper
• Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation

  1996cites this paper
• New Efficient Majority Circuits for the Computation of Some Basic Arithmetic Functions 1

  1996influential citation
• δ-Bit serial binary addition with linear threshold networks

  1996cites this paper
• 2-1 Additions and Related Arithmetic Operations with Threshold Logic

  1996cites this paper
• On the Power of Democratic Networks

  1996cites this paper
• Efficient pipelined multi-operand adders with high throughput and low latency: designs and applications

  1996cites this paper
• A Size-Depth Trade-Off for the Analog Computation of Boolean Functions

  1996cites this paper
• 2 Counters and Multiplication with Linear Threshold Logic

  1996cites this paper
• VLSI complexity of threshold gate COMPARISON

  1996cites this paper
• Neural Network Hardware Implementations

  1996cites this paper
• 2-1 Addition and Related Arithmetic perations with Threshold Logic

  1996cites this paper
• Optimal Mapping of Neural Networks onto FPGA's - A New Constructive Algorithm -

  1995influential citation
• Constant fan-in digital neural networks are VLSI-optimal

  1995cites this paper
• VLSI Optimal Neural Network Learning Algorithm

  1995cites this paper
• Periodic Symmetric Functions with Feed-Forward Neural Networks

  1995cites this paper