Size and Energy of Threshold Circuits Computing Mod Functions

DOI10.1007/978-3-642-03816-7_61zbMath1250.68133OpenAlexW1602965566MaRDI QIDQ3182969

Kei Uchizawa, Eiji Takimoto, Takao Nishizeki

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_61

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Energy and depth of threshold circuits ⋮ Size-energy tradeoffs for unate circuits computing symmetric Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
• Upper and lower bounds for some depth-3 circuit classes
• Energy Complexity and Depth of Threshold Circuits
• 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

This page was built for publication: Size and Energy of Threshold Circuits Computing Mod Functions