On the kernelization complexity of string problems (Q1749539)
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 kernelization complexity of string problems |
scientific article; zbMATH DE number 6869366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the kernelization complexity of string problems |
scientific article; zbMATH DE number 6869366 |
Statements
On the kernelization complexity of string problems (English)
0 references
17 May 2018
0 references
string problems
0 references
closest string
0 references
kernelization
0 references
cross-composition
0 references
0 references
0.9953919649124146
0 references
0.8422064185142517
0 references
0.8183295130729675
0 references
0.8165873885154724
0 references
