Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem)

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/w/index.php?title=Tamaki,_Tokuyama_(approximate)_(2-dimensional_Maximum_subarray_problem)&oldid=45691"