A randomized algorithm for finding maximum with O((log n)2) polynomial tests

https://doi.org/10.1016/0020-0190(94)90052-3Get rights and content

Abstract

A well-known result by Rabin implies that n − 1 polynomial tests are necessary and sufficient in the worst case to find the maximum of n distinct real numbers. In this note we show that, for any fixed constant c > 0, there is a randomized algorithm with error probability O(n-c) for finding the maximum of n distinct real numbers using only O((log n)2) polynomial tests.

References (1)

Cited by (6)

  • Selecting the k largest elements with parity tests

    2000, Discrete Applied Mathematics
  • Randomized complexity of linear arrangements and polyhedra

    1999, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Selecting the k largest elements with parity tests

    1998, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

The research was supported in part by the National Science Foundation grant CCR-9301430.

View full text