ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS
From MaRDI portal
Publication:2841982
DOI10.1142/S0129054113400029zbMath1285.68049MaRDI QIDQ2841982
Akira Suzuki, Xiao Zhou, Kei Uchizawa
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions ⋮ Energy and Fan-In of Threshold Circuits Computing Mod Functions ⋮ Size, Depth and Energy of Threshold Circuits Computing Parity Function.
Cites Work
- Energy and depth of threshold circuits
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- On the Computational Power of Threshold Circuits with Sparse Activity
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
