Jeuring (Longest Palindromic Substring Longest Palindromic Substring)

From Algorithm Wiki

Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Jeuring_(Longest_Palindromic_Substring_Longest_Palindromic_Substring)&oldid=45460"