Pages that link to "Item:Q4636650"

The following pages link to Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates (Q4636650):

Displaying 9 items.

• Using amplification to compute majority with small majority gates (Q677991) (← 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)
• A circuit of depth two with limited input branching for majority functions (Q1725545) (← links)
• Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
• 30th Conference on Computational Complexity (CCC 2015) (Q4601826) (← links)
• (Q5005185) (← links)
• On Expressing Majority as a Majority of Majorities (Q5220471) (← links)
• A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)