Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
