BibTeX
@MISC{Ramesh_stringmatching,
author = {H. Ramesh and V. Vinay},
title = {String Matching in ... Quantum Time},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We show how to determine whether a given pattern p of length m occurs in a given text t of length n in m) time, with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling.
