Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641)
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: Why is it hard to beat O(n^2) for longest common weakly increasing subsequence? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? |
scientific article |
Statements
Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (English)
0 references
16 March 2018
0 references
computational complexity
0 references
longest common weakly increasing subsequence
0 references
lower bound
0 references
SETH
0 references
0 references
0.82023096
0 references
0.82003784
0 references
0 references
0.8016004
0 references
0.8002299
0 references
0.79964566
0 references
0 references
0.79812986
0 references
