Tight conditional lower bounds for longest common increasing subsequence (Q2272597)
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 7103275
| 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 7103275 |
Statements
Tight conditional lower bounds for longest common increasing subsequence (English)
0 references
10 September 2019
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.8749982714653015
0 references
0.8261505365371704
0 references
0.824170708656311
0 references
0.809864342212677
0 references
