Near-Optimal Quantum Algorithms for String Problems

We study quantum algorithms for several fundamental string problems, including Longest Common Substring , Lexicographically Minimal String Rotation , and Longest Square Substring . These problems have been widely studied in the stringology literature since the 1970s, and are known to be solvable by...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 85; číslo 8; s. 2260 - 2317
Hlavní autori:	Akmal, Shyan, Jin, Ce
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2023 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Gall Mathematics of Computing Rotation Strings Synchronism Theory of Computation Quantum walks Longest common substring String synchronizing sets String processing
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!