Non-Uniform and Learning Algorithms for String Matching Problems
arXiv: Computational Complexity, 2018.
String matching is the fundamental algorithmic problem of deciding whether a string of length $n$ contains a pattern of length $k leq n$. study string matching algorithms from a nonuniform as well as learning theoretic perspective. nonuniform algorithms we consider the problem of designing small circuits that solve string matching under...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)