Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen, Dominik, Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
TL;DR
This paper proves that determining whether a string can be uniquely factored into palindromes is an NP-complete problem, highlighting the computational difficulty of this string factorization task.
Contribution
It establishes the NP-completeness of the problem of diverse palindromic factorization, a previously unresolved question in computational complexity.
Findings
Deciding unique palindromic factorizations is NP-complete.
The problem remains hard even for restricted classes of strings.
This result connects palindromic factorization to classical NP-complete problems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.