Energy and depth of threshold circuits
From MaRDI portal
Publication:410715
DOI10.1016/j.tcs.2010.08.006zbMath1234.94093OpenAlexW2075882682MaRDI QIDQ410715
Eiji Takimoto, Takao Nishizeki, Kei Uchizawa
Publication date: 3 April 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.006
Related Items (7)
Energy and fan-in of logic circuits computing symmetric Boolean functions ⋮ Size-energy tradeoffs for unate circuits computing symmetric Boolean functions ⋮ Energy Complexity of Recurrent Neural Networks ⋮ Energy and Fan-In of Threshold Circuits Computing Mod Functions ⋮ 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
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Size and Energy of Threshold Circuits Computing Mod Functions
- Energy Complexity and Depth of Threshold Circuits
- On the Computational Power of Threshold Circuits with Sparse Activity
- Rational approximation techniques for analysis of neural networks
- Size--Depth Tradeoffs for Threshold Circuits
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Energy and depth of threshold circuits
