Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2017.11.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2017.11.007 / rank | |||
Normal rank | |||
Latest revision as of 05:00, 11 December 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
0 references
