SMAWK algorithm ( Minimum value in each row of an implicitly-defined totally monotone matrix): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 425 bytes +425‎ Created page with "== Time Complexity == $O(n({1}+log(n/m)$)) == Space Complexity == $O(n)$ auxiliary? words (Need to keep track of which columns aren't pruned. Also uses $O(n)$ auxiliary space during prune-and-search?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://link.springer.com/article/10.1007/BF01840359"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/SMAWK_algorithm_(_Minimum_value_in_each_row_of_an_implicitly-defined_totally_monotone_matrix)"