Tight conditional lower bounds for longest common increasing subsequence (Q5111874)
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: Tight conditional lower bounds for longest common increasing subsequence |
scientific article; zbMATH DE number 7205199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight conditional lower bounds for longest common increasing subsequence |
scientific article; zbMATH DE number 7205199 |
Statements
27 May 2020
0 references
fine-grained complexity
0 references
combinatorial pattern matching
0 references
sequence alignments
0 references
parameterized complexity
0 references
SETH
0 references
0 references
0 references
0 references
0.9973225593566896
0 references
0.8774058222770691
0 references
0.8288573026657104
0 references
0.8269559741020203
0 references
0.8080850839614868
0 references
