Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ BarrierMohammadTaghi HajiAghayi,Masoud Seddighin, Saeedreza Seddighin,Xiaorui SunSIAM Journal on Computing（2022）引用 0|浏览5暂无评分AI 理解论文溯源树样例生成溯源树，研究论文发展脉络Chat Paper正在生成论文摘要
