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: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

Journal publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Published year: 2021