Pages that link to "Item:Q4640035"
From MaRDI portal
The following pages link to Diverse Palindromic Factorization is NP-Complete (Q4640035):
Displaying 5 items.
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- Factorizing strings into repetitions (Q2135631) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)