The following pages link to (Q4638059):
Displayed 6 items.
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5121902) (← links)
- (Q5140838) (← links)
- A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence (Q6075744) (← links)
- (Q6084394) (← links)