Powering requires threshold depth 3
type: Item
instance of: scholarly article
title: Powering requires threshold depth 3
zbMATH Open document ID: 1184.68269
author: Alexander A. Sherstov
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5664787
zbMATH Keywords: computational complexity
zbMATH Keywords: threshold circuits
zbMATH Keywords: circuit lower bounds
zbMATH Keywords: complexity of arithmetic operations
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.11.003
OpenAlex ID: W2050739958
cites work: The expressive power of voting polynomials
cites work: Majority gates vs. general weighted threshold gates
cites work: Simulating Threshold Circuits by Majority Circuits
cites work: Threshold circuits of bounded depth
cites work: Q4284623
cites work: On small depth threshold circuits
cites work: On the Power of Threshold Circuits with Small Weights
cites work: Depth efficient neural networks for division and related problems
cites work: On Optimal Depth Threshold Circuits for Multiplication and Related Problems
cites work: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
DOI: 10.1016/J.IPL.2006.11.003
description: scientific article; zbMATH DE number 5664787