Diverse Palindromic Factorization is NP-Complete

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

研究成果: ジャーナルへの寄稿記事

1 引用 (Scopus)

抄録

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.

元の言語英語
ページ(範囲)143-163
ページ数21
ジャーナルInternational Journal of Foundations of Computer Science
29
発行部数2
DOI
出版物ステータス出版済み - 2 1 2018

Fingerprint

Factorization

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

これを引用

Diverse Palindromic Factorization is NP-Complete. / Bannai, Hideo; Gagie, Travis; Inenaga, Shunsuke; Kärkkäinen, Juha; Kempa, Dominik; Piakowski, Marcin; Sugimoto, Shiho.

:: International Journal of Foundations of Computer Science, 巻 29, 番号 2, 01.02.2018, p. 143-163.

研究成果: ジャーナルへの寄稿記事

Bannai, Hideo ; Gagie, Travis ; Inenaga, Shunsuke ; Kärkkäinen, Juha ; Kempa, Dominik ; Piakowski, Marcin ; Sugimoto, Shiho. / Diverse Palindromic Factorization is NP-Complete. :: International Journal of Foundations of Computer Science. 2018 ; 巻 29, 番号 2. pp. 143-163.
@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 = "2",
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

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 -