Pages that link to "Item:Q1269909"
From MaRDI portal
The following pages link to On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909):
Displaying 33 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- On the power of small-depth threshold circuits (Q685717) (← links)
- On the size of depth-two threshold circuits for the inner product mod 2 function (Q782579) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- Exponential sums and circuits with a single threshold gate and mod-gates (Q1293551) (← links)
- A note on a theorem of Barrington, Straubing and Thérien (Q1351160) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Exploring learnability between exact and PAC (Q1780447) (← links)
- The hardest halfspace (Q1983325) (← links)
- 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 (Q1996847) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits (Q2509033) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596) (← links)
- The multiparty communication complexity of set disjointness (Q2817790) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- On realizing iterated multiplication by small depth threshold circuits (Q4596612) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- (Q5009530) (← links)
- (Q5092483) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5158501) (← links)
- (Q5875514) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- Fundamentals of Computation Theory (Q5900795) (← links)
