Energy Complexity and Depth of Threshold Circuits
From MaRDI portal
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
(17)- Lower bounds for linear decision trees via an energy complexity argument
- Energy and depth of threshold circuits
- New bounds for energy complexity of Boolean functions
- Towards an energy complexity of computation
- Energy-efficient threshold circuits computing MOD functions
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
- Energy-efficient threshold circuits for comparison functions
- Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions
- On the power of small-depth threshold circuits
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
- Energy and fan-in of threshold circuits computing mod functions
- Energy Complexity and Entropy of Threshold Circuits
- Size and Energy of Threshold Circuits Computing Mod Functions
- Matrix multiplication in quadratic time and energy? Towards a fine-grained energy-centric church-Turing thesis
- 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
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)
