Login / Signup

Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier.

MohammadTaghi HajiaghayiMasoud SeddighinSaeedreza SeddighinXiaorui Sun
Published in: SIAM J. Comput. (2022)
Keyphrases