NSTL国家科技图书文献中心

外文文献中文文献

筛选条件：

共搜索到3条信息

在线阅读? 全文链接文献传递科学数据

1. Quantum Algorithm for Lexicographically Minimal String Rotation NSTL国家科技图书文献中心

Qisheng Wang | Mingsheng Ying - 《Theory of computing systems》 - 2024,68(1) - 29～74 - 共46页 - 被引量：1

摘要：Abstract Lexicographically minimal string | rotation (LMSR) is a problem to find the minimal one | among all rotations of a string* in the lexicographical* | ]{minimal} usepackage{amsmath} usepackage{wasysym | (nlogn)documentclass[12pt]{minimal} usepackage{amsmath

关键词： Quantum computing | Quantum algorithms | Quantum query complexity | String problems | Lexicographically minimal string rotation

2. Near-Optimal Quantum Algorithms for String Problems NSTL国家科技图书文献中心

Shyan Akmal | Ce Jin - 《Algorithmica》 - 2023,85(8) - 2260～2317 - 共58页 - 被引量：1

摘要： lexicographically minimal string rotation. CoRR, 2020. arXiv | Common Substring, Lexicographically Minimal String | Minimal String Rotation can be solved by a quantum | several fundamental string* problems, including Longest* | Rotation, and Longest Square Substring. These problems

关键词： String processing | Quantum walks | Longest common substring | String synchronizing sets

3. Near-Optimal Quantum Algorithms for String Problems NSTL国家科技图书文献中心

Shyan Akmal | Ce Jin - 《ACM-SIAM Symposium on Discrete Algorithms: SODA22, Alexandria, Virginia, USA, 9-12 January 2022, volume 4 of 5》 - ACM-SIAM Symposium on Discrete Algorithms - 2022, - 2791～2832 - 共42页

摘要： Substring, Lexicographically* Minimal String Rotation, and* | covers. Lexicographically* Minimal String Rotation can* | fundamental string* problems, including Longest Common* | careful combination of string* synchronizing sets (Kempa* | naturally extend to other related string* problems, such as*

NSTL主题词： Cosmic strings | algorithms | quanta

上一页1下一页

检索结果集分析

结构化综述分析

Lexicographically minimal string rotation

NSTL学科导航

服务站

成员单位

友情链接