On the computational power of depth-2 circuits with threshold and modulo gates
From MaRDI portal
Publication:1269909
Recommendations
- On the computational power of depth 2 circuits with threshold and modulo gates
- Mathematical Foundations of Computer Science 2005
- On the size of depth-two threshold circuits for the inner product mod 2 function
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- scientific article; zbMATH DE number 773998
- On the power of small-depth threshold circuits
- Size and Energy of Threshold Circuits Computing Mod Functions
- Threshold circuits of bounded depth
- Exponential lower bound for bounded depth circuits with few threshold gates
Cites work
- A guided tour of Chernoff bounds
- A weight-size trade-off for circuits with MOD \(m\) gates
- Depth efficient neural networks for division and related problems
- Exponential size lower bounds for some depth three circuits
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 46318 (Why is no real title available?)
- scientific article; zbMATH DE number 176508 (Why is no real title available?)
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Majority gates vs. general weighted threshold gates
- Non-uniform automata over groups
- On the computational power of depth 2 circuits with threshold and modulo gates
- Simple Constructions of Almost k-wise Independent Random Variables
- Simulating threshold circuits by majority circuits
- Some notes on threshold circuits, and multiplication in depth 4
- The expressive power of voting polynomials
Cited in
(37)- Unconditional lower bounds for learning intersections of halfspaces
- An arithmetic model of computation equivalent to threshold circuits
- Exponential sums and circuits with a single threshold gate and mod-gates
- A note on a theorem of Barrington, Straubing and Thérien
- Upper and lower bounds for some depth-3 circuit classes
- Exploring learnability between exact and PAC
- The hardest halfspace
- On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
- Polynomial threshold functions and Boolean threshold circuits
- On the computational power of depth 2 circuits with threshold and modulo gates
- The multiparty communication complexity of set disjointness
- Nonuniform ACC circuit lower bounds
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
- Hardness amplification and the approximate degree of constant-depth circuits
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- scientific article; zbMATH DE number 1256663 (Why is no real title available?)
- scientific article; zbMATH DE number 1129497 (Why is no real title available?)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- The power of asymmetry in constant-depth circuits
- Lower bounds for depth-three circuits with equals and Mod-gates
- On realizing iterated multiplication by small depth threshold circuits
- Lower Bounds for (MODp - MODm) Circuits
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0
- Approximate degree and the complexity of depth three circuits
- scientific article; zbMATH DE number 7561760 (Why is no real title available?)
- A lifting theorem with applications to symmetric functions
- Algorithmic Polynomials
- The large-error approximate degree of \(\mathrm{AC}^0\)
- Mathematical Foundations of Computer Science 2005
- The large-error approximate degree of \(\mathrm{AC}^0\)
- Circuits on cylinders.
- Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- A note on the power of majority gates and modular gates
- On the power of small-depth threshold circuits
- On the size of depth-two threshold circuits for the inner product mod 2 function
This page was built for publication: On the computational power of depth-2 circuits with threshold and modulo gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269909)
