Pages that link to "Item:Q1346614"
From MaRDI portal
The following pages link to Complex polynomials and circuit lower bounds for modular counting (Q1346614):
Displaying 13 items.
- The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear (Q357917) (← links)
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree (Q1590080) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Addition is exponentially harder than counting for shallow monotone circuits (Q4978062) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- An exact characterization of symmetric functions in \(qAC^{0}[2]\) (Q5941440) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
