Lower bounds of temporal and spatial complexity of the substring search problem

DOI10.1515/DMA-2014-0033zbMATH Open1344.68314OpenAlexW2321050804MaRDI QIDQ2629755

E. M. Perper

Publication date: 7 July 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2014-0033

zbMATH Keywords

lower boundsearchsubstring

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (2)

The algorithm for identical object searching with bounded worst-case complexity and linear memory ⋮ Complexity of substring search in a set of strings

This page was built for publication: Lower bounds of temporal and spatial complexity of the substring search problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629755)