Jeuring (Longest Palindromic Substring Longest Palindromic Substring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ auxiliary? words (Stores (and uses) previously computed palindrome information; unclear if O(n) is best bound possible) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1994 == Reference == https://doi.org/10.1007%2FBF01182773") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$? words | ||
(Stores (and uses) previously computed palindrome information; unclear if O(n) is best bound possible) | (Stores (and uses) previously computed palindrome information; unclear if O(n) is best bound possible) | ||
Latest revision as of 07:57, 10 April 2023
Time Complexity
$O(n)$
Space Complexity
$O(n)$? words
(Stores (and uses) previously computed palindrome information; unclear if O(n) is best bound possible)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1994