In [1] the authors use a lemma to prove their Theorem 1 (pp. 352-353). While the lemma is true, there is a defect in its proof, for one cannot assume that each of the symbols appearing as a type IV reference is in t(Ek , s). Using their example (p. 350) as a reference string with k = 12, t(E12 , 3) is 534 and lacks the two symbols (1 and 2) which appear as type IV references.
John E. Pomeranz
Author Archives
The problem of the cyclical majority is presented and some new, simulated results for 3, 4, 5, … , 40 issues and 3, 5, 7, … , 37 judges are reported.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved