![[2606.03929] Revisiting $O(n \log \log n)$ chaining for anchored edit distance](/static/img/curated/desks/afbytes-tech.png)
[2606.03929] Revisiting $O(n \log \log n)$ chaining for anchored edit distance
Abstract page for arXiv paper 2606.03929: Revisiting $O(n \log \log n)$ chaining for anchored edit distance
America Forever Bytes
complexity · AFBytes
Other
complexity
Recent coverage
[2606.03975] Planar Perfect Matching Counting is as Hard as Determinants
Abstract page for arXiv paper 2606.03975: Planar Perfect Matching Counting is as Hard as Determinants
[2510.06796] On the complexity of estimating ground state entanglement and free energy
Abstract page for arXiv paper 2510.06796: On the complexity of estimating ground state entanglement and free energy
[2605.29540] Dichotomy study of the Steiner tree problem in split-like graphs
Abstract page for arXiv paper 2605.29540: Dichotomy study of the Steiner tree problem in split-like graphs
[2605.29823] Quantifying and Optimizing Simplicity via Polynomial Representations
Abstract page for arXiv paper 2605.29823: Quantifying and Optimizing Simplicity via Polynomial Representations
[2605.28138] A Deterministic Separation Lemma
Abstract page for arXiv paper 2605.28138: A Deterministic Separation Lemma