Energy Complexity and Entropy of Threshold Circuits

DOI10.1007/11786986_55MaRDI QIDQ3613796zbMATH OpenOpenAlexFDO

Authors Kei Uchizawa, R. J. Douglas, Wolfgang Maass

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_55

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• On the Computational Power of Threshold Circuits with Sparse Activity
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• Lower bounds for threshold circuits of bounded energy
• Energy and depth of threshold circuits
• Energy Complexity and Depth of Threshold Circuits

Cited in

(6)

• Towards an energy complexity of computation
• On the activity of cell circuits realising the system of all conjunctions
• Information-theoretic lower bound on energy cost of stochastic computation
• Energy complexity of recurrent neural networks
• Lower bounds for threshold circuits of bounded energy
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity

This page was built for publication: Energy Complexity and Entropy of Threshold Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613796)