A randomized algorithm for finding maximum with O((log n)2) polynomial tests☆
References (1)
Proving simultaneous positivity of linear forms
J. Comput. System Sci.
(1972)
Cited by (6)
On the decisional complexity of problems over the reals
2001, Information and ComputationSelecting the k largest elements with parity tests
2000, Discrete Applied MathematicsRandomized 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)An exponential lower bound on the size of algebraic decision trees for max
1998, Computational ComplexityRandomization and the computational power of analytic and algebraic decision trees
1996, Computational Complexity
- ☆
The research was supported in part by the National Science Foundation grant CCR-9301430.
Copyright © 1994 Published by Elsevier B.V.