On the Computational Power of Threshold Circuits with Sparse Activity

DOI10.1162/neco.2006.18.12.2994zbMath1104.92003OpenAlexW2117016759WikidataQ47847477 ScholiaQ47847477MaRDI QIDQ3421380

Rodney J. Douglas, Kei Uchizawa, Wolfgang Maass

Publication date: 12 February 2007

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco.2006.18.12.2994

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Circuits, networks (94C99)

Related Items

Size and Energy of Threshold Circuits Computing Mod Functions ⋮ Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case ⋮ Energy and fan-in of logic circuits computing symmetric Boolean functions ⋮ Computing the best-case energy complexity of satisfying assignments in monotone circuits ⋮ Energy and depth of threshold circuits ⋮ Size-energy tradeoffs for unate circuits computing symmetric Boolean functions ⋮ Energy Complexity of Recurrent Neural Networks ⋮ Succinct certification of monotone circuits ⋮ Energy and Fan-In of Threshold Circuits Computing Mod Functions ⋮ Size, Depth and Energy of Threshold Circuits Computing Parity Function. ⋮ Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity ⋮ Succinct monotone circuit certification: planarity and parameterized complexity ⋮ New bounds for energy complexity of Boolean functions ⋮ On the relationship between energy complexity and other Boolean function measures ⋮ ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS

Cites Work

• Threshold circuits of bounded depth
• Upper and lower bounds on switching energy in VLSI
• On the activity of cell circuits realising the system of all conjunctions