Kernelization lower bound for permutation pattern matching (Q2339595)
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 6422532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernelization lower bound for permutation pattern matching |
scientific article; zbMATH DE number 6422532 |
Statements
Kernelization lower bound for permutation pattern matching (English)
0 references
2 April 2015
0 references
parameterized complexity
0 references
polynomial kernels
0 references
permutation pattern matching
0 references
0.7944367527961731
0 references
0.775568425655365
0 references
0.7744942307472229
0 references
0.7687917351722717
0 references
0.7637352347373962
0 references
