Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
type: Item
instance of: scholarly article
title: Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity
zbMATH Open document ID: 1152.68047
author: Kei Uchizawa
author: Eiji Takimoto
published in: Theoretical Computer Science
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 92B20
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5368350
zbMATH Keywords: threshold circuits
zbMATH Keywords: neural networks
zbMATH Keywords: communication complexity
zbMATH Keywords: energy complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.07.028
OpenAlex ID: W1979569157
cites work: Mathematical Foundations of Computer Science 2005
cites work: Q5316396
cites work: A linear lower bound on the unbounded error probabilistic communication complexity.
cites work: Threshold circuits of bounded depth
cites work: On the power of small-depth threshold circuits
cites work: Upper and lower bounds on switching energy in VLSI
cites work: Communication Complexity
cites work: Q5595902
cites work: Q4284623
cites work: How Close Are We to Understanding V1?
cites work: Q4875278
cites work: \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
cites work: Q4835643
cites work: On the Computational Power of Threshold Circuits with Sparse Activity
DOI: 10.1016/J.TCS.2008.07.028
description: scientific article; zbMATH DE number 5368350