We derive lower bounds for the expected number of color comparisons when the cn colorings are equally probable. We prove a general lower bound of c/3n − O(√n) ...
Table 3 summarizes the present state of knowledge of algorithms and lower bounds for the average-case plurality problem. Of course the gaps between the best ...
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by ...
We derive lower bounds for the expected number of color comparisons when the cn colorings are equally probable. We prove a general lower bound of ...
Alonso, L., and Reingold, E. M. 2008a. Average-case lower bounds for the plurality problem. ACM Trans. Algorithms 4, 3 (Jun), 27--1--27--17.
Oct 22, 2024 · For c = 2, we have the majority problem; [2] established identical upper and lower bounds of 2n/3 + O( √ n) on the average case. For c ≥ 3, [3] ...
Oct 28, 2008 · A matching lower bound for this problem follows from the result of [5] on the average case complexity using Yao's principle: Yao's principle [13] ...
Oct 4, 2019 · However, the sampling lower bound only rules out sampling (U, f(U)) in AC0 with exponentially small statistical distance. In this work we ...
Missing: plurality | Show results with:plurality
Jun 16, 2018 · Abstract: We show average-case lower bounds for explicit Boolean functions against bounded-depth threshold circuits with a superlinear ...
Missing: plurality | Show results with:plurality
In this paper we established upper and lower bounds for oblivious and adaptive strategies used to solve the Majority and Plurality problems. These prob- lems ...