Pages that link to "Item:Q1313712"
From MaRDI portal
The following pages link to A randomized algorithm for finding maximum with \(O((\log n)^2)\) polynomial tests (Q1313712):
Displaying 4 items.
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- On the decisional complexity of problems over the reals (Q1854429) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- Selecting the \(k\) largest elements with parity tests (Q1975371) (← links)