Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115)
From MaRDI portal
!
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 6290410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving SCS for bounded length strings in fewer than \(2^n\) steps |
scientific article; zbMATH DE number 6290410 |
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
0 references
0 references
0.8811219930648804
0 references
0.8282275795936584
0 references
0.8063799738883972
0 references
0.8036606311798096
0 references
0.8012230396270752
0 references
