Diverse Palindromic Factorization is NP-Complete

Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piakowski; Shiho Sugimoto

doi:10.1142/S0129054118400014

Diverse Palindromic Factorization is NP-Complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piakowski, Shiho Sugimoto

Mathematical Informatics

Research output: Contribution to journal › Article › peer-review

4 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 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	https://doi.org/10.1142/S0129054118400014
Publication status	Published - Feb 1 2018

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)

Access to Document

10.1142/S0129054118400014

Fingerprint Dive into the research topics of 'Diverse Palindromic Factorization is NP-Complete'. Together they form a unique fingerprint.

Cite this

@article{2f8552d8a4134a2d8e251cb2aca927c6,

title = "Diverse Palindromic Factorization is NP-Complete",

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.",

author = "Hideo Bannai and Travis Gagie and Shunsuke Inenaga and Juha K{\"a}rkk{\"a}inen and Dominik Kempa and Marcin Piakowski and Shiho Sugimoto",

year = "2018",

month = feb,

day = "1",

doi = "10.1142/S0129054118400014",

language = "English",

volume = "29",

pages = "143--163",

journal = "International Journal of Foundations of Computer Science",

issn = "0129-0541",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "2",

}

TY - JOUR

T1 - Diverse Palindromic Factorization is NP-Complete

AU - Bannai, Hideo

AU - Gagie, Travis

AU - Inenaga, Shunsuke

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

AU - Piakowski, Marcin

AU - Sugimoto, Shiho

PY - 2018/2/1

Y1 - 2018/2/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85045195640&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045195640&partnerID=8YFLogxK

U2 - 10.1142/S0129054118400014

DO - 10.1142/S0129054118400014

M3 - Article

AN - SCOPUS:85045195640

VL - 29

SP - 143

EP - 163

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 2

ER -