String matching in Õ(√n + √m) quantum time

Authors:
H. Ramesh;V. Vinay
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560012, India
Venue:
Journal of Discrete Algorithms
Year:
2003

Citing 3
Cited 2

Deterministic sampling: a new technique for fast pattern matching

SIAM Journal on Computing
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum Counting

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming

Real-Time String Filtering of Large Databases Implemented Via a Combination of Artificial Neural Networks

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Reconstructing strings from substrings with quantum queries

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to determine whether a given pattern p of length m occurs in a given text t of length n in Õ(√n+√m) time (where Õ allows for logarithmic factors in m and n/m) with inverse polynomial failure probability. This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling.