Energy Complexity and Depth of Threshold Circuits

DOI10.1007/978-3-642-03409-1_30MaRDI QIDQ3183623zbMATH OpenOpenAlexFDO

Authors Kei Uchizawa, Takao Nishizeki, Eiji Takimoto

Publication date 20 October 2009

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03409-1_30

Mathematics Subject Classification ID

Recommendations

• Energy 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
• New bounds for energy complexity of Boolean functions
• Energy and fan-in of threshold circuits computing mod functions

Cited in

(20)

• Towards an energy complexity of computation
• Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
• Computing the best-case energy complexity of satisfying assignments in monotone circuits
• Energy-efficient threshold circuits computing MOD functions
• Energy and fan-in of threshold circuits computing mod functions
• Lower bounds for linear decision trees via an energy complexity argument
• Size and Energy of Threshold Circuits Computing Mod Functions
• scientific article; zbMATH DE number 4205989 (Why is no real title available?)
• Energy Complexity and Entropy of Threshold Circuits
• Energy and depth of threshold circuits
• Energy-efficient threshold circuits for comparison functions
• Information-theoretic lower bound on energy cost of stochastic computation
• New bounds for energy complexity of Boolean functions
• On the relationship between energy complexity and other Boolean function measures
• New bounds for energy complexity of Boolean functions
• On the relationship between energy complexity and other Boolean function measures
• Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
• On the power of small-depth threshold circuits
• Matrix multiplication in quadratic time and energy? Towards a fine-grained energy-centric church-Turing thesis
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity

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

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