Deterministic Longest Common Subsequence Approximation in Near-Linear Time
Abstract
We provide a deterministic algorithm that outputs an O(n3/4 n)-approximation for the Longest Common Subsequence (LCS) of two input sequences of length n in near-linear time. This is the first deterministic approximation algorithm for LCS that achieves a sub-linear approximation ratio in near-linear time.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.