Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (Q5199158)
From MaRDI portal
scientific article; zbMATH DE number 5938185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem |
scientific article; zbMATH DE number 5938185 |
Statements
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (English)
0 references
12 August 2011
0 references
