"Approximating LCS in Linear Time: Beating the √n Barrier."

MohammadTaghi Hajiaghayi et al. (2020)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2020-03-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics