Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem): 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.

    15 February 2023

    • curprev 11:1811:18, 15 February 2023‎ Admin talk contribs‎ 357 bytes +357‎ Created page with "== Time Complexity == $O(n^(omega)$ * (-log(epsilon))/epsilon) == Space Complexity == words () == Description == == Approximate? == Approximate Approximation Factor: (1-epsilon) == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://dl.acm.org/doi/pdf/10.5555/314613.314823"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Tamaki,_Tokuyama_(approximate)_(2-dimensional_Maximum_subarray_problem)"