Thông tin tài liệu
Nhan đề : |
Quantum Meets Fine-Grained Complexity Sublinear Time Quantum Algorithms for String Problems |
Tác giả : |
François Le, Gall Saeed, Seddighin |
Năm xuất bản : |
2022 |
Nhà xuất bản : |
Springer |
Tóm tắt : |
Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds. Our results shed light on a very surprising fact: Although the classic solutions for LCS and LPS are almost identical (via suffix trees), their quantum computational complexities are different. While we give an exact O~(n−−√) time algorithm for LPS, we prove that LCS needs at least time Ω~(n2/3) even for 0/1 strings. |
Mô tả: |
CC BY |
URI: |
https://link.springer.com/article/10.1007/s00453-022-01066-z https://dlib.phenikaa-uni.edu.vn/handle/PNK/8335 |
Bộ sưu tập |
OER - Công nghệ thông tin |
XEM MÔ TẢ
44
XEM TOÀN VĂN
66
Danh sách tệp tin đính kèm: