Diverse Palindromic Factorization Is NP-complete - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Hideo Bannai' in GoogleThis author has not been identified. Look up 'Travis Gagie' in GoogleThis author has not been identified. Look up 'Shunsuke Inenaga' in GoogleThis author has not been identified. Look up 'Juha Kärkkäinen' in GoogleThis author has not been identified. Look up 'Dominik Kempa' in GoogleThis author has not been identified. Look up 'Marcin Piatkowski' in GoogleThis author has not been identified. Look up 'Simon J. Puglisi' in GoogleThis author has not been identified. Look up 'Shiho Sugimoto' in Google

runs on WebDSL