Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
type: Item
instance of: scholarly article
title: Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
zbMATH Open document ID: 1207.94091
author: Kei Uchizawa
author: Eiji Takimoto
author: Takao Nishizeki
published in: Theoretical Computer Science
publication date: 2011-02-21T00:00:00Z
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5853810
zbMATH Keywords: energy complexity
zbMATH Keywords: parity function
zbMATH Keywords: size-energy tradeoff
zbMATH Keywords: symmetric Boolean functions
zbMATH Keywords: threshold circuits
zbMATH Keywords: unate circuits
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.022
OpenAlex ID: W2090245216
cites work: Q3651735
cites work: Lower Bounds for (MODp - MODm) Circuits
cites work: Size--Depth Tradeoffs for Threshold Circuits
cites work: Upper and lower bounds on switching energy in VLSI
cites work: Q5595902
cites work: Q4875278
cites work: General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
cites work: Q4835643
cites work: Rational approximation techniques for analysis of neural networks
cites work: Energy-efficient threshold circuits computing MOD functions
cites work: On the Computational Power of Threshold Circuits with Sparse Activity
cites work: Energy and depth of threshold circuits
cites work: Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
cites work: Size and Energy of Threshold Circuits Computing Mod Functions
cites work: Q3762226
cites work: The complexity of the parity function in unbounded fan-in, unbounded depth circuits
DOI: 10.1016/J.TCS.2010.11.022
description: scientific article; zbMATH DE number 5853810