Pages that link to "Item:Q677991"
From MaRDI portal
The following pages link to Using amplification to compute majority with small majority gates (Q677991):
Displaying 8 items.
- A characteristic polynomial (Q1186974) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Formula complexity of a linear function in a \(k\)-ary basis (Q2037681) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
