Diverse Palindromic Factorization is NP-Complete (Q4640035)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6868664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diverse Palindromic Factorization is NP-Complete |
scientific article; zbMATH DE number 6868664 |
Statements
Diverse Palindromic Factorization is NP-Complete (English)
0 references
15 May 2018
0 references
NP-complete problems on strings
0 references
string factorization
0 references
palindromes
0 references
