Energy and fan-in of logic circuits computing symmetric Boolean functions

DOI10.1016/j.tcs.2012.11.039zbMath1302.94077OpenAlexW2004222053MaRDI QIDQ393138

Akira Suzuki, Xiao Zhou, Kei Uchizawa

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.039

zbMATH Keywords

Boolean functionssymmetric functionsparity functionthreshold circuitsenergy complexityfan-inMOD functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items

New bounds for energy complexity of Boolean functions ⋮ On the relationship between energy complexity and other Boolean function measures

Cites Work

• Energy and depth of threshold circuits
• Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
• On the power of small-depth threshold circuits
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• On the Computational Power of Threshold Circuits with Sparse Activity