Energy and depth of threshold circuits

DOI10.1016/J.TCS.2010.08.006MaRDI QIDQ410715zbMATHOpenAlexFDO

Authors Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

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

zbMATH Keywords

neural networksdepththreshold circuitsenergy complexity

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Energy Complexity and Depth of Threshold Circuits
• 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 and fan-in of threshold circuits computing mod functions
• Energy-efficient threshold circuits for comparison functions

Cites work

• scientific article; zbMATH DE number 761425 (Why is no real title available?)
• scientific article; zbMATH DE number 872005 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• Energy Complexity 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
• Rational approximation techniques for analysis of neural networks
• Size and Energy of Threshold Circuits Computing Mod Functions
• Size--Depth Tradeoffs for Threshold Circuits

Cited in

(19)

• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• Energy and fan-in of logic circuits computing symmetric Boolean functions
• Energy Complexity and Entropy of Threshold Circuits
• Almost all functions require exponential energy
• Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
• Energy Complexity and Depth of Threshold Circuits
• Size and Energy of Threshold Circuits Computing Mod Functions
• New bounds for energy complexity of Boolean functions
• Energy complexity of recurrent neural networks
• On the relationship between energy complexity and other Boolean function measures
• scientific article; zbMATH DE number 5573202 (Why is no real title available?)
• Energy-efficient threshold circuits detecting global pattern in 1-dimentional arrays
• Energy and fan-in of threshold circuits computing mod functions
• Lower bounds for linear decision trees via an energy complexity argument
• Energy-efficient threshold circuits computing MOD functions
• New bounds for energy complexity of Boolean functions
• Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
• Lower bounds for threshold circuits of bounded energy
• Energy-efficient threshold circuits for comparison functions

This page was built for publication: Energy and depth of threshold circuits

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