Pages that link to "Item:Q2272597"
From MaRDI portal
The following pages link to Tight conditional lower bounds for longest common increasing subsequence (Q2272597):
Displaying 4 items.
- Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- Hierarchical categories in colored searching (Q6577435) (← links)