Pages that link to "Item:Q1590077"
From MaRDI portal
The following pages link to Lower bounds for modular counting by circuits with modular gates (Q1590077):
Displaying 13 items.
- Correlation lower bounds from correlation upper bounds (Q280948) (← links)
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Exponential sums and circuits with a single threshold gate and mod-gates (Q1293551) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits (Q2509033) (← links)
- A degree-decreasing lemma for \((\text{MOD}_q - \text{MOD}_p)\) circuits (Q2752469) (← links)
- On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596) (← links)
- A weight-size trade-off for circuits with MOD \(m\) gates (Q2817598) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- Automata, Languages and Programming (Q5716847) (← links)
