${\tilde O}(\sqrt{n}+\sqrt{m})$量子时间中的串匹配
String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time
摘要:
我们展示了如何确定一个给定的模式p的长度m是否出现在一个给定的文本t的长度n在${\tilde O}(\sqrt{n}+\sqrt{m})$ \footnote{${\tilde O}$ allows for logarithmic factors in m and $n/m$}时间,逆多项式失败概率。该算法将量子搜索算法与并行字符串匹配技术相结合,称为{ \em确定性采样}。
英文摘要:
We show how to determine whether a given pattern p of length m occurs in a given text t of length n in ${\tilde O}(\sqrt{n}+\sqrt{m})$\footnote{${\tilde O}$ allows for logarithmic factors in m and $n/m$} time, with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called {\em Deterministic Sampling}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。