Pages that link to "Item:Q1346614"

The following pages link to Complex polynomials and circuit lower bounds for modular counting (Q1346614):

Displaying 8 items.

• Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
• Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← 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)
• An exact characterization of symmetric functions in \(qAC^{0}[2]\) (Q5941440) (← links)
• Circuit complexity before the dawn of the new millennium (Q6567750) (← links)