Beyond Naïve Approximation for Longest Common Subsequence
An advanced inquiry into approximation algorithms for the Longest Common Subsequence problem, moving beyond conventional methods to explore more sophisticated solutions.
Theory & AlgosAlgorithms & Data StructuresComputational Complexityapproximation algorithmslongest common subsequence
Theory-Fest 2019-2020: Fine-Grained Complexity
Seminar notes & discussion
No public seminar notes on this lecture yet.