Pages that link to "Item:Q1028119"
From MaRDI portal
The following pages link to On randomized algorithms for the majority problem (Q1028119):
Displaying 14 items.
- The majority game with an arbitrary majority (Q284827) (← links)
- On approximate majority and probabilistic time (Q626665) (← links)
- Determining the majority (Q688232) (← links)
- Do local majorities force a global majority? (Q1089361) (← links)
- The \(r\)-majority vote action on 0-1 sequences (Q1336659) (← links)
- Algorithmic aspects of majority domination (Q1371054) (← links)
- Variants of the majority problem. (Q1422403) (← links)
- The quantum black-box complexity of majority (Q1871636) (← links)
- Computing majority via multiple queries (Q2453124) (← links)
- Randomized algorithms for the majority problem (Q2851502) (← links)
- The capacity of majority rule (Q4379730) (← links)
- (Q4608618) (← links)
- Randomized algorithms for finding a majority element (Q5369511) (← links)
- Algorithms and Computation (Q5897884) (← links)