Diverse Palindromic Factorization is NP-Complete

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.