Theoretical computer science · Oct 6, 2026

Almost-linear approximation of edit distance

For every fixed rational ε∈(0,1)\varepsilon\in(0,1), gives a randomized (1+ε)(1+\varepsilon) approximation to unit-cost edit distance in worst-case expected time N1+o(1)N^{1+o(1)}, with success probability at least 2/3. The strings have total length N and polynomially bounded integer symbols. This is an asymptotic guarantee at fixed accuracy.

Contributors

Unreleased OpenAI model

AI systems: Unreleased OpenAI model

Sources