Size--Depth Tradeoffs for Threshold Circuits
From MaRDI portal
Publication:4337668
DOI10.1137/S0097539792282965zbMath0870.68069OpenAlexW2001187993MaRDI QIDQ4337668
Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
Publication date: 26 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792282965
Related Items
Affine projections of symmetric polynomials., Local reduction, Quantified Derandomization: How to Find Water in the Ocean, Size and Energy of Threshold Circuits Computing Mod Functions, Uniform derandomization from pathetic lower bounds, Energy and depth of threshold circuits, Size-energy tradeoffs for unate circuits computing symmetric Boolean functions, Unnamed Item, Size, Depth and Energy of Threshold Circuits Computing Parity Function., Unnamed Item, A super-quadratic lower bound for depth four arithmetic circuits, Hardness magnification near state-of-the-art lower bounds, Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity, Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits, Quadratization of symmetric pseudo-Boolean functions, A \#SAT algorithm for small constant-depth circuits with PTF gates
