Pages that link to "Item:Q4375395"

The following pages link to Tight Ω(<i>n</i>lg<i>n</i>) lower bound for finding a longest increasing subsequence (Q4375395):

Displaying 6 items.

• The longest almost-increasing subsequence (Q765507) (← links)
• Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
• Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← links)
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)