A Linear-Time n^{0.4}-Approximation for Longest Common Subsequence

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Karl Bringmann, Vincent Cohen-Addad, Debarati Das

Journal title: ACM Transactions on Algorithms

Journal number: 19(1)

Journal publisher: Association for Computing Machinary, Inc.

Published year: 2023

Published pages: 9:1-9:24

DOI identifier: 10.1145/3568398

ISSN: 1549-6325