1991-12
On computing majority by comparisons
1991-12-01
majority
basic operations
https://doi.org/10.1007/bf01275672
383-387
class
cases
SETX
The elements of a finite setX (of odd cardinalityn) are divided into two (as yet unknown) classes and a member of the larger class is to be identified. The basic operation is to test whether two objects are in the same class. We show thatn-B(n) comparisons are necessary and sufficient in worst case, whereB(n) is the number of 1's in the binary expansion ofn.
binary expansion
article
2022-12-01T06:20
expansion
members
comparison
same class
finite setX
number
elements
objects
thatn
false
operation
articles
worst case
large class
https://scigraph.springernature.com/explorer/license/
doi
10.1007/bf01275672
Saks
Michael E.
Michael
Werman
0209-9683
Combinatorica
1439-6912
Springer Nature
4
Department of Mathematics and RUTCOR, Rutgers University, 08903, New Brunswick, NJ
Bell Communications Research, 07960, Morristown, NJ, USA
Bell Communications Research, 07960, Morristown, NJ, USA
pub.1001435218
dimensions_id
11
Institute for Mathematics and its Applications, University of Minnesota, 55455, Minneapolis, Minn, USA
Institute for Mathematics and its Applications, University of Minnesota, 55455, Minneapolis, Minn, USA
Information and Computing Sciences
Mathematical Sciences
Springer Nature - SN SciGraph project