On the complexity of unsigned translocation distance (Q818147)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of unsigned translocation distance |
scientific article; zbMATH DE number 5015111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of unsigned translocation distance |
scientific article; zbMATH DE number 5015111 |
Statements
On the complexity of unsigned translocation distance (English)
0 references
24 March 2006
0 references
unsigned translocation
0 references
NP-hardness
0 references
inapproximability
0 references
0.8807226419448853
0 references
0.8805293440818787
0 references
0.8582280278205872
0 references
0.8556976914405823
0 references
0.854521632194519
0 references
