Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
type: Item
instance of: scholarly article
title: Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
zbMATH Open document ID: 0875.94139
DOI: 10.1016/0020-0190(95)00137-2
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984891
zbMATH Keywords: Computational complexity
zbMATH Keywords: Threshold circuits
zbMATH Keywords: Lower bounds
author: Stasys Jukna
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00137-2
OpenAlex ID: W1980226746
cites work: Q4385519
cites work: Top-down lower bounds for depth-three circuits
cites work: Q5606602
cites work: Pi-sigma-pi threshold formulas
cites work: On small depth threshold circuits
cites work: \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
cites work: Q3221885
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: Q4839052
Recommended article: On the computational power of depth-2 circuits with threshold and modulo gates
Recommended article: On the computational power of depth 2 circuits with threshold and modulo gates
Recommended article: Threshold circuits of bounded depth
Recommended article: Threshold circuits of small majority-depth
Recommended article: On the power of small-depth threshold circuits
Recommended article: On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
Recommended article: The complexity of depth-3 circuits computing symmetric Boolean functions
Recommended article: Exponential lower bound for bounded depth circuits with few threshold gates
description: scientific article; zbMATH DE number 984891