Pages that link to "Item:Q4337428"
From MaRDI portal
The following pages link to The Average-Case Complexity of Determining the Majority (Q4337428):
Displayed 19 items.
- The plurality problem with three colors and more. (Q557833) (← links)
- Computing majority with triple queries (Q690459) (← links)
- How to play the majority game with a liar (Q960976) (← links)
- Randomized strategies for the plurality problem (Q1003477) (← links)
- On randomized algorithms for the majority problem (Q1028119) (← links)
- The worst-case chip problem (Q1029103) (← links)
- Tight bounds on plurality (Q1044713) (← links)
- Determining the majority: The biased case (Q1364402) (← links)
- Variants of the majority problem. (Q1422403) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- From discrepancy to majority (Q1751093) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- Truth tellers and liars with fewer questions (Q2342617) (← links)
- Analysis of Boyer and Moore's \texttt{MJRTY} algorithm (Q2444743) (← links)
- Computing majority via multiple queries (Q2453124) (← links)
- Finding Mode Using Equality Comparisons (Q2803838) (← links)
- Randomized algorithms for the majority problem (Q2851502) (← links)
- Searching for majority with k-tuple queries (Q5261043) (← links)
- Search for a majority element (Q5957833) (← links)