Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates

DOI10.1016/0020-0190(95)00137-2zbMath0875.94139OpenAlexW1980226746MaRDI QIDQ672256

Stasys P. Jukna

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00137-2

zbMATH Keywords

Computational complexityLower boundsThreshold circuits

Mathematics Subject Classification ID

Related Items (2)

On set systems with a threshold property ⋮ Non-uniform Turán-type problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Top-down lower bounds for depth-three circuits
• \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
• Pi-sigma-pi threshold formulas
• On small depth threshold circuits

This page was built for publication: Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates