Diverse Palindromic Factorization is NP-Complete
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
关注微信公众号
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈