Pages that link to "Item:Q3451091"
From MaRDI portal
The following pages link to Diverse Palindromic Factorization Is NP-complete (Q3451091):
Displayed 7 items.
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- Palindromic factorization of rich words (Q2143052) (← links)
- Computing equality-free and repetitive string factorisations (Q2634669) (← links)
- Computing Equality-Free String Factorisations (Q3195710) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- (Q5089256) (← links)
- Counting Palindromes in Substrings (Q5150941) (← links)