scientific article; zbMATH DE number 6297691
From MaRDI portal
Publication:5417608
zbMath1288.68085MaRDI QIDQ5417608
No author found.
Publication date: 22 May 2014
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) Distributed algorithms (68W15)
Related Items (3)
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ Estimating the Longest Increasing Sequence in Polylogarithmic Time ⋮ Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
This page was built for publication:
