Work

Diverse Palindromic Factorization is NP-Complete

Year: 2018

Type: article

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.

Source: International Journal of Foundations of Computer Science

DOI: 10.1142/s0129054118400014

Authors: Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piątkowski, Shiho Sugimoto

Institutions: Kyushu University, Universidad Diego Portales, University of Helsinki, Helsinki Institute for Information Technology, Nicolaus Copernicus University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Japan Society for the Promotion of Science

Awards: Information Implosion Foundational Technology, 文字列組み合わせ論による情報学へのアプローチ, Analysis of upper and lower bounds on string processing problems via advanced data structures, 情報爆縮に基づくIoTデータ処理基盤の構築, Combinatorics of repetitive structures in strings and its applications

OpenAlex ID: W2796857528

FWCI: 0.527

Cites: 6

Cited by: 7

Related to: