Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving SCS for bounded length strings in fewer than \(2^n\) steps |
scientific article |
Statements
Solving SCS for bounded length strings in fewer than \(2^n\) steps (English)
0 references
30 April 2014
0 references
exponential-time algorithm
0 references
shortest common superstring
0 references
traveling salesman problem
0 references
NP-hard problem
0 references
exact algorithm
0 references
