Energy Complexity and Entropy of Threshold Circuits

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Colloquium on Automata, Languages and Programming

• Publication date

  2006-07-10

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1007/11786986_55
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The cost of cortical computation.

  2003cited by this paper
• On the activity of cell circuits realising the system of all conjunctions

  2003cited by this paper
• In vivo, low-resistance, whole-cell recordings from neurons in the anaesthetized and awake mammalian brain

  2002cited by this paper
• Discrete Neural Computation: A Theoretical Foundation

  1995cited by this paper
• A multiscale dynamic routing circuit for forming size- and position-invariant object representations

  1995cited by this paper
• Circuit complexity and neural networks

  1994cited by this paper
• Theoretical Advances in Neural Computation and Learning

  1994cited by this paper
• On Linear Decision Trees Computing Boolean Functions

  1991cited by this paper
• Energy complexity of optical computations

  1990cited by this paper
• Upper and lower bounds on switching energy in VLSI

  1990cited by this paper
• Threshold circuits of bounded depth

  1987cited by this paper
• Perceptrons: An Introduction to Computational Geometry

  1969cited by this paper

• Computing the best-case energy complexity of satisfying assignments in monotone circuits

  2022influential citation
• Succinct certification of monotone circuits

  2021cites this paper
• Energy Complexity of Satisfying Assignments in Monotone Circuits: On the Complexity of Computing the Best Case

  2021cites this paper
• Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity

  2020cites this paper
• New Bounds for Energy Complexity of Boolean Functions

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

  2018cites this paper
• On the relationship between energy complexity and other boolean function measures

  2018cites this paper
• Neural computing for scientific computing applications: more than just machine learning

  2017cites this paper
• Computational Complexity and the Function-Structure-Environment Loop of the Brain

  2016cites this paper
• Energy-Time Tradeoff in Recurrent Neural Nets

  2015cites this paper
• Energy Complexity of Recurrent Neural Networks

  2014cites this paper
• Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays

  2013cites this paper
• A Low-Energy Implementation of Finite Automata by Optimal-Size Neural Nets

  2013cites this paper
• Energy and fan-in of logic circuits computing symmetric Boolean functions

  2013cites this paper
• On Counting Output Patterns of Logic Circuits

  2013influential citation
• Selective Review of Visual Attention Models

  2013cites this paper
• ANALYSIS AND REDUCTION OF MISMATCH IN LOW POWER SUBTHRESHOLD SILICON NEURONS

  2012cites this paper
• Lower Bounds for Linear Decision Trees via an Energy Complexity Argument

  2011cites this paper
• Energy and Fan-In of Threshold Circuits Computing Mod Functions

  2011cites this paper
• Energy and depth of threshold circuits

  2010cites this paper
• Communication Complexity with Synchronized Clocks

  2010cites this paper
• An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity

  2007cites this paper