Advertisement

The complexity of finding replicas using equality tests

  • Gudmund Skovbjerg Frandsen
  • Peter Bro Miltersen
  • Sven Skyum
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)

Abstract

We prove (for fixed k) that at least \(\tfrac{1}{{k - 1}}(\begin{array}{*{20}c}n \\2 \\\end{array} ) - O(n)\) equality tests and no more than \(\tfrac{2}{k}(\begin{array}{*{20}c}n \\2 \\\end{array} ) + O(n)\) equality tests are needed in the worst case to determine whether a given set of n elements contains a subset of k identical elements. The upper bound is an improvement by a factor 2 compared to known results. We give tighter bounds for k=3.

Keywords

Equivalence Class Correct Answer Identical Element Equality Test Equality Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bollobás, B., Extremal Graph Theory. Academic Press, 1978.Google Scholar
  2. 2.
    Campbell, D. and McNeill, T., Finding a majority when sorting is not available. The Computer Journal 34 (1991) 186.Google Scholar
  3. 3.
    Fischer, M. J. and Salzburg S. L., Solution to problem 81-5. Journal of Algorithms 3 (1982) 376–379.Google Scholar
  4. 4.
    Matula, D. W., An Optimal Algorithm for the Majority Problem. Manuscript, Southern Methodist University, Texas, 1990.Google Scholar
  5. 5.
    Misra, J. and Gries, D., Finding Repeated Elements. Science of Computer Programming 2 (1982) 143–152.Google Scholar
  6. 6.
    Moore, J., Problem 81-5. Journal of Algorithms 2 (1981) 208–209.Google Scholar
  7. 7.
    Saks, M. E. and Werman, M., On Computing Majority by Comparisons. Combinatorica 11 (1991) 383–387.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Gudmund Skovbjerg Frandsen
    • 1
  • Peter Bro Miltersen
    • 1
  • Sven Skyum
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityAarhus CDenmark

Personalised recommendations