scientific article; zbMATH DE number 6850386
From MaRDI portal
Publication:4607965
zbMath1403.68368arXiv1703.08940MaRDI QIDQ4607965
Karl Bringmann, Paweł Gawrychowski, Shay Mozes, Oren Weimann
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1703.08940
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Related Items (8)
Algebraic dynamic programming on trees ⋮ Improved bounds for rectangular monotone min-plus product and applications ⋮ On the hardness of computing the edit distance of shallow trees ⋮ Unnamed Item ⋮ Inexact tree pattern matching with 1-degree edit distance using finite automata ⋮ Unnamed Item ⋮ New and improved algorithms for unordered tree inclusion ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
This page was built for publication:
