Diverse Palindromic Factorization is NP-Complete
arXiv:1503.04045 · doi:10.1142/S0129054118400014
Abstract
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.
arXiv:1503.04045 · doi:10.1142/S0129054118400014
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.