Diverse Palindromic Factorization Is NP-complete

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto. Diverse Palindromic Factorization Is NP-complete. In Igor Potapov, editor, Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Volume 9168 of Lecture Notes in Computer Science, pages 85-96, Springer, 2015. [doi]

No reviews for this publication, yet.