#19155: Improving complexity of lps and is_symmetric for finite words
-------------------------------------------------+-------------------------
Reporter: nadialafreniere | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: palindromes, finite words, | Merged in:
days 69 | Reviewers:
Authors: Nadia Lafrenière | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Changes (by {'newvalue': u'Nadia Lafreni\xe8re', 'oldvalue': ''}):
* author: => Nadia Lafrenière
* cc: sschanck, mlapointe (added)
* component: PLEASE CHANGE => combinatorics
* keywords: => palindromes, finite words, days 69
* type: PLEASE CHANGE => defect
Old description:
New description:
The purpose of this patch is to improve the complexity of is_symmetric
function for words from quadratic to linear. To do this, we modify the lps
(longest palindrome suffix) function to make it linear (using the last
value of lps_lengths), and use a property of the longest palindrome suffix
of a square.
Apart of the interest for the function in itself, the goal is to make an
is_christoffel function that computes the answer in linear time (see
ticket #19159).
--
--
Ticket URL: <http://trac.sagemath.org/ticket/19155#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
