Jeuring (Longest Palindromic Substring Longest Palindromic Substring)

From Algorithm Wiki

Revision as of 07:57, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

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

Reference

https://doi-org.ezproxy.canberra.edu.au/10.1007%2FBF01182773

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