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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have