Size--Depth Tradeoffs for Threshold Circuits
From MaRDI portal
Recommendations
Cited in
(38)- Majority gates vs. general weighted threshold gates
- Threshold circuits of small majority-depth
- Depth reduction for circuits of unbounded fan-in
- Approximating threshold circuits by rational functions
- Local reduction
- Affine projections of symmetric polynomials.
- A \#SAT algorithm for small constant-depth circuits with PTF gates
- Threshold circuits of bounded depth
- Quadratization of symmetric pseudo-Boolean functions
- Impossibility results for weak threshold networks
- On the power of a threshold gate at the top
- Depth lower bounds against circuits with sparse orientation
- Uniform derandomization from pathetic lower bounds
- Size and Energy of Threshold Circuits Computing Mod Functions
- Decomposition of threshold functions into bounded fan-in threshold functions
- Energy and depth of threshold circuits
- Exponential lower bound for bounded depth circuits with few threshold gates
- scientific article; zbMATH DE number 1256716 (Why is no real title available?)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- Average-case lower bounds and satisfiability algorithms for small threshold circuits
- scientific article; zbMATH DE number 4003533 (Why is no real title available?)
- scientific article; zbMATH DE number 773999 (Why is no real title available?)
- Hardness magnification near state-of-the-art lower bounds
- Quantified Derandomization: How to Find Water in the Ocean
- A \#SAT algorithm for small constant-depth circuits with PTF gates
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
- Hardness magnification near state-of-the-art lower bounds
- A super-quadratic lower bound for depth four arithmetic circuits
- Bootstrapping results for threshold circuits ``just beyond known lower bounds
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
- Average-case lower bounds and satisfiability algorithms for small threshold circuits
- Mathematical Foundations of Computer Science 2005
- Size, Depth and Energy of Threshold Circuits Computing Parity Function.
- Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
- Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees
- Neural networks with linear threshold activations: structure and algorithms
- On the power of small-depth threshold circuits
This page was built for publication: Size--Depth Tradeoffs for Threshold Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337668)
