Divide and Conquer ( Minimum value in each row of an implicitly-defined totally monotone matrix)
Jump to navigation
Jump to search
Time Complexity
$O(m*log(n)$)
Space Complexity
$O(log(n)$) auxiliary? words
(Need to keep track of the specific indices where the minimums occur, up to depth log(n))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1987