Pages that link to "Item:Q5716847"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716847):
Displaying 13 items.
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q1590077) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
- A weight-size trade-off for circuits with MOD \(m\) gates (Q2817598) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- (Q4205392) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- On minimal π-circuits of closing contacts for symmetric functions with threshold 2 (Q5491245) (← links)
