String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time

H. Ramesh; V. Vinay

String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time

量子物理 2007-05-23 v1

作者: H. Ramesh , V. Vinay

摘要

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}.

关键词

quantum search algorithms statistical algorithms time series analysis

引用

@article{arxiv.quant-ph/0011049,
  title  = {String Matching in ${\tilde O}(\sqrt{n}+\sqrt{m})$ Quantum Time},
  author = {H. Ramesh and V. Vinay},
  journal= {arXiv preprint arXiv:quant-ph/0011049},
  year   = {2007}
}

备注

7 pages Latex2e file

相关论文

查看更多相关论文 →