Energy-efficient threshold circuits computing MOD functions

DOI10.1142/S0129054113400029MaRDI QIDQ2841982zbMATH OpenFDO

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)

zbMATH Keywords

neural networkscircuit complexitythreshold circuitsenergy complexity

Mathematics Subject Classification ID

Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Size and Energy of Threshold Circuits Computing Mod Functions
• Energy and fan-in of threshold circuits computing mod functions
• Energy and depth of threshold circuits
• Energy-efficient threshold circuits for comparison functions
• Energy Complexity and Depth of Threshold Circuits

Cites work

• Energy and depth of threshold circuits
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• On the Computational Power of Threshold Circuits with Sparse Activity
• Size-energy tradeoffs for unate circuits computing symmetric Boolean functions

Cited in

(7)

• Almost all functions require exponential energy
• Size and Energy of Threshold Circuits Computing Mod Functions
• Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays
• Energy and fan-in of threshold circuits computing mod functions
• 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

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)