Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Diverse Palindromic Factorization is NP-...

Bannai, Hideo...

Free

Share this content

Diverse Palindromic Factorization is NP-Complete by Bannai, Hideo ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	13-03-2015
Summary	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.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	doi:10.1142/S0129054118400014

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Bannai, Hideo. Diverse Palindromic Factorization is NP-Complete. N.A. March 13, 2015. Accessed October 02, 2025. https://online.provdatabase.com/cite/18439

APA 7th EditionReferences

Bannai, Hideo. (2015). Diverse Palindromic Factorization is NP-Complete. N.A. https://online.provdatabase.com/cite/18439

Chicago 17th EditionReferences

Bannai, Hideo. Diverse Palindromic Factorization is NP-Complete. N.A. 2015. https://online.provdatabase.com/cite/18439

HarvardReferences

Bannai, Hideo. (2015). Diverse Palindromic Factorization is NP-Complete. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18439. (Accessed 02 October 2025).

Harvard AustraliaReferences

Bannai, Hideo, 2015, Diverse Palindromic Factorization is NP-Complete, N.A, viewed 02 October 2025, <https://online.provdatabase.com/cite/18439>

MLA 9th EditionWorks Cited

Bannai, Hideo. Diverse Palindromic Factorization is NP-Complete. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18439.

Share this eBook