Diverse Palindromic Factorization is NP-Complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto. Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci., 29(2):143-164, 2018. [doi]

Authors

Hideo Bannai

This author has not been identified. Look up 'Hideo Bannai' in Google

Travis Gagie

This author has not been identified. Look up 'Travis Gagie' in Google

Shunsuke Inenaga

This author has not been identified. Look up 'Shunsuke Inenaga' in Google

Juha Kärkkäinen

This author has not been identified. Look up 'Juha Kärkkäinen' in Google

Dominik Kempa

This author has not been identified. Look up 'Dominik Kempa' in Google

Marcin Piatkowski

This author has not been identified. Look up 'Marcin Piatkowski' in Google

Shiho Sugimoto

This author has not been identified. Look up 'Shiho Sugimoto' in Google