Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600)
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 6309992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity Analysis for the Closest String with Wildcards Problem |
scientific article; zbMATH DE number 6309992 |
Statements
Parameterized Complexity Analysis for the Closest String with Wildcards Problem (English)
0 references
30 June 2014
0 references
0.99999976
0 references
0.9147165
0 references
0.91117746
0 references
0.90287805
0 references
0.88488835
0 references
0.88430315
0 references
0.8839945
0 references
