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.
Original language | English |
---|---|
Pages (from-to) | 143-163 |
Number of pages | 21 |
Journal | International Journal of Foundations of Computer Science |
Volume | 29 |
Issue number | 2 |
DOIs | |
Publication status | Published - Feb 1 2018 |
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)