Paper Info
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.
Year
DOI
Venue
2018
10.1142/S0129054118400014
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Keywords
DocType
Volume
NP-complete problems on strings, string factorization, palindromes
Journal
29
Issue
ISSN
Citations 
2
0129-0541
5
PageRank 
References 
Authors
0.60
7
8
Name
Order
Citations
PageRank
Hideo Bannai162079.87
Travis Gagie264363.61
Shunsuke Inenaga359579.02
Juha Kärkkäinen4135495.20
Dominik Kempa514216.37
Marcin Piatkowski682.42
Simon J. Puglisi7113275.14
Shiho Sugimoto8122.62