加载中…
2015-03-13
Diverse Palindromic Factorization is NP-Complete
Hideo BannaiTravis GagieShunsuke InenagaJuha KarkkainenDominik KempaMarcin PiatkowskiSimon J. PuglisiShiho Sugimoto
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本