Pages that link to "Item:Q2811168"
From MaRDI portal
The following pages link to Improved bounds for the randomized decision tree complexity of recursive majority (Q2811168):
Displaying 5 items.
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- (Q4228517) (← links)
- Separation Between Deterministic and Randomized Query Complexity (Q5376437) (← links)
- Non-reversible stationary states for majority voter and Ising dynamics on trees (Q6614493) (← links)