Pages that link to "Item:Q673905"
From MaRDI portal
The following pages link to A note on the power of majority gates and modular gates (Q673905):
Displaying 9 items.
- On the correlation between parity and modular polynomials (Q692898) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- A circuit of depth two with limited input branching for majority functions (Q1725545) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- On the computational power of depth 2 circuits with threshold and modulo gates (Q2817596) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)