Pages that link to "Item:Q2817596"
From MaRDI portal
The following pages link to On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596):
Displaying 17 items.
- On the power of a threshold gate at the top (Q287188) (← 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 correlation between parity and modular polynomials (Q692898) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- A note on a theorem of Barrington, Straubing and Thérien (Q1351160) (← links)
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- \(\mathrm{MOD}_p\)-tests, almost independence and small probability spaces (Q4500687) (← links)
- On realizing iterated multiplication by small depth threshold circuits (Q4596612) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
