Name
Abstract | ||
|---|---|---|
We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the balls in the set are of the same color or not. In the so-called Counting Model the answer to a query gives the difference between the cardinalities of the color classes in the query. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.dam.2018.06.015 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Combinatorial search,Majority | Discrete mathematics,Combinatorics,Ask price,Ball (bearing),Cardinality,Majority problem,Mathematics | Journal |
Volume | ISSN | Citations |
254 | 0166-218X | 0 |
PageRank | References | Authors |
0.34 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Máté Vizer | 2 | 27 | 14.06 |