107 citations · 409 across the 18 of their papers we have counts for
1 paper · 1 filter
Hideo Bannai, Travis Gagie, Shunsuke Inenaga +5
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.