On Hardness of Several String Indexing Problems.

Kasper Green Larsen J. Ian Munro Jesper Sindahl Nielsen Sharma V. Thankachan

Published in: CPM (2014)

Keyphrases

np complete
data structure
worst case
problems involving
data sets
multi dimensional
optimization problems
solving problems
databases
data mining
computational complexity
lower bound
state space
nearest neighbor
access methods
np hardness