On small depth threshold circuits
From MaRDI portal
Publication:5056127
DOI10.1007/3-540-55706-7_4zbMath1502.68121MaRDI QIDQ5056127
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_4
68Q06: Networks and circuits as models of computation; circuit complexity
Related Items
New algorithms and lower bounds for circuits with linear threshold gates, Decomposition of threshold functions into bounded fan-in threshold functions, Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates, Powering requires threshold depth 3, Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions, \(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom, Circuit lower bounds from learning-theoretic approaches