Combinatorial search
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Information Processing Letters
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing
Hi-index | 0.00 |
Suppose we are given $n$ coloured balls and an integer $k$ between 2 and $n$. How many colour-comparisons $Q(n,k)$ are needed to decide whether $k$ balls have the same colour? The corresponding problem when there is an (unknown) linear order with repetitions on the balls was solved asymptotically by Björner, Lovász and Yao, the complexity being \smash{$\theta (n\log\frac{2n}{k})$}. Here we give the exact answer for \smash{$k\frac{n}{2}: Q(n,k)=2n-k-1$}, and the order of magnitude for arbitrary \smash{$k:Q(n,k)=\theta(\frac{n^2}{k})$}.