Size-energy tradeoffs for unate circuits computing symmetric Boolean functions

DOI10.1016/j.tcs.2010.11.022zbMath1207.94091OpenAlexW2090245216MaRDI QIDQ627177

Eiji Takimoto, Takao Nishizeki, Kei Uchizawa

Publication date: 21 February 2011

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

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

zbMATH Keywords

parity functionsymmetric Boolean functionsthreshold circuitsenergy complexitysize-energy tradeoffunate circuits

Mathematics Subject Classification ID

Related Items

Energy and fan-in of logic circuits computing symmetric Boolean functions ⋮ Energy Complexity of Recurrent Neural Networks ⋮ Energy and Fan-In of Threshold Circuits Computing Mod Functions ⋮ Size, Depth and Energy of Threshold Circuits Computing Parity Function. ⋮ New bounds for energy complexity of Boolean functions ⋮ On the relationship between energy complexity and other Boolean function measures ⋮ ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Energy and depth of threshold circuits
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits
• ENERGY-EFFICIENT THRESHOLD CIRCUITS COMPUTING MOD FUNCTIONS
• Size and Energy of Threshold Circuits Computing Mod Functions
• On the Computational Power of Threshold Circuits with Sparse Activity
• Upper and lower bounds on switching energy in VLSI
• Rational approximation techniques for analysis of neural networks
• Size--Depth Tradeoffs for Threshold Circuits
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Lower Bounds for (MOD_p - MOD_m) Circuits