Energy-efficient threshold circuits computing MOD functions
From MaRDI portal
Publication:2841982
DOI10.1142/S0129054113400029zbMATH Open1285.68049MaRDI QIDQ2841982FDOQ2841982
Authors: Akira Suzuki, Kei Uchizawa, Xiao Zhou 
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- On the Computational Power of Threshold Circuits with Sparse Activity
- 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
Cited In (7)
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
- Energy-efficient threshold circuits for comparison functions
- Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays
- Almost all functions require exponential energy
- Energy and fan-in of threshold circuits computing mod functions
- Size and Energy of Threshold Circuits Computing Mod Functions
This page was built for publication: Energy-efficient threshold circuits computing MOD functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841982)
