Diverse palindromic factorization is NP-complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski, Simon J. Puglisi, Shiho Sugimoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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 languageEnglish
Title of host publicationDevelopments in Language Theory - 19th International Conference, DLT 2015, Proceedings
EditorsIgor Potapov
PublisherSpringer Verlag
Pages85-96
Number of pages12
ISBN (Print)9783319214993
DOIs
Publication statusPublished - 2015
Event19th International Conference on Developments in Language Theory, DLT 2015 - Liverpool, United Kingdom
Duration: Jul 27 2015Jul 30 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9168
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Conference on Developments in Language Theory, DLT 2015
CountryUnited Kingdom
CityLiverpool
Period7/27/157/30/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Diverse palindromic factorization is NP-complete'. Together they form a unique fingerprint.

  • Cite this

    Bannai, H., Gagie, T., Inenaga, S., Kärkkäinen, J., Kempa, D., Piątkowski, M., Puglisi, S. J., & Sugimoto, S. (2015). Diverse palindromic factorization is NP-complete. In I. Potapov (Ed.), Developments in Language Theory - 19th International Conference, DLT 2015, Proceedings (pp. 85-96). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9168). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_6