The plurality problem with three colors and more.
From MaRDI portal
(Redirected from Publication:557833)
Recommendations
Cites work
- Determining the majority
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2003
- On computing majority by comparisons
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Search for a majority element
- STACS 2004
- The Average-Case Complexity of Determining the Majority
- The worst-case chip problem
- Variants of the majority problem.
Cited in
(16)- Randomized strategies for the plurality problem
- Majority problems of large query size
- From discrepancy to majority
- A plurality problem with three colors and query size three
- Adaptive majority problems for restricted query graphs and for weighted sets
- Computing majority via multiple queries
- The majority game with an arbitrary majority
- Probabilistic strategies for the partition and plurality problems
- Determining plurality
- Searching for majority with k-tuple queries
- STACS 2004
- STACS 2005
- Computing and Combinatorics
- Adaptive majority problems for restricted query graphs and for weighted sets
- Finding non-minority balls with majority and plurality queries
- How to play the majority game with a liar
This page was built for publication: The plurality problem with three colors and more.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557833)