scientific article; zbMATH DE number 6850385
From MaRDI portal
Publication:4607964
zbMath1403.68367arXiv1804.04178MaRDI QIDQ4607964
Mohammad Ghodsi, Mahdi Safarnejad Boroujeni, Soheil Ehsani, Saeed Seddighin, Mohammad Taghi Hajiaghayi
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1804.04178
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Algorithms on strings (68W32) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (5)
Equivalence classes and conditional hardness in massively parallel computations ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
This page was built for publication:
