On computing majority by comparisons

Michael E. Saks; Michael Werman

doi:10.1007/BF01275672

On computing majority by comparisons

Michael E. Saks^*, Michael Werman

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

62 Scopus citations

Abstract

The elements of a finite set X (of odd cardinality n) 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 that n-B(n) comparisons are necessary and sufficient in worst case, where B(n) is the number of 1's in the binary expansion of n.

Original language	English
Pages (from-to)	383-387
Number of pages	5
Journal	Combinatorica
Volume	11
Issue number	4
DOIs	https://doi.org/10.1007/BF01275672
State	Published - Dec 1991
Externally published	Yes

Keywords

AMS subject classification (1991): 68P10, 68R05

Access to Document

10.1007/BF01275672

Cite this

@article{a4077a3d23664002ada8d4d982378411,

title = "On computing majority by comparisons",

abstract = "The elements of a finite set X (of odd cardinality n) 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 that n-B(n) comparisons are necessary and sufficient in worst case, where B(n) is the number of 1's in the binary expansion of n.",

keywords = "AMS subject classification (1991): 68P10, 68R05",

author = "Saks, {Michael E.} and Michael Werman",

year = "1991",

month = dec,

doi = "10.1007/BF01275672",

language = "אנגלית",

volume = "11",

pages = "383--387",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "4",

}

TY - JOUR

T1 - On computing majority by comparisons

AU - Saks, Michael E.

AU - Werman, Michael

PY - 1991/12

Y1 - 1991/12

N2 - The elements of a finite set X (of odd cardinality n) 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 that n-B(n) comparisons are necessary and sufficient in worst case, where B(n) is the number of 1's in the binary expansion of n.

AB - The elements of a finite set X (of odd cardinality n) 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 that n-B(n) comparisons are necessary and sufficient in worst case, where B(n) is the number of 1's in the binary expansion of n.

KW - AMS subject classification (1991): 68P10, 68R05

UR - http://www.scopus.com/inward/record.url?scp=0010822175&partnerID=8YFLogxK

U2 - 10.1007/BF01275672

DO - 10.1007/BF01275672

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0010822175

SN - 0209-9683

VL - 11

SP - 383

EP - 387

JO - Combinatorica

JF - Combinatorica

IS - 4

ER -

On computing majority by comparisons

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this