Diverse Palindromic Factorization is NP-Complete

Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Karkkainen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto

doi:10.1142/S0129054118400014

Diverse Palindromic Factorization is NP-Complete

Formal Languages and Automata Theory 2020-12-15 v3

Authors: Hideo Bannai , Travis Gagie , Shunsuke Inenaga , Juha Karkkainen , Dominik Kempa , Marcin Piatkowski , Simon J. Puglisi , Shiho Sugimoto

View on arXiv ↗ PDF ↗ DOI ↗

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.

Keywords

computational complexity

Cite

@article{arxiv.1503.04045,
  title  = {Diverse Palindromic Factorization is NP-Complete},
  author = {Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha Karkkainen and Dominik Kempa and Marcin Piatkowski and Simon J. Puglisi and Shiho Sugimoto},
  journal= {arXiv preprint arXiv:1503.04045},
  year   = {2020}
}