|
|||||
|
|
Tight bounds on plurality |
|
| Authors: | Nikhil Srivastava |
| Affiliation: | Department of Mathematics, Union College, Schenectady, NY 12308, USA |
| Abstract: | We show that  pairwise equality comparisons are necessary and sufficient (in the worst case) to find a plurality in n colored balls. |
| Keywords: | Analysis of algorithms Computational complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |