Diverse Palindromic Factorization is NP-Complete
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
cs.FL↗
arXiv subjects
Publications and source records attributed to Juha Karkkainen.
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.