DE eng

Search in the Catalogues and Directories

Hits 1 – 4 of 4

1
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems ...
Le Gall, François; Seddighin, Saeed. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022
BASE
Show details
2
Near-Optimal Quantum Algorithms for String Problems ...
Akmal, Shyan; Jin, Ce. - : arXiv, 2021
BASE
Show details
3
Quantum Algorithm for Lexicographically Minimal String Rotation ...
Wang, Qisheng; Ying, Mingsheng. - : arXiv, 2020
BASE
Show details
4
Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems ...
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
4
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern