Answers are grounded in this paper and cite their sources.
This paper explores the relation between discrete convolution/correlation and string matching for different specific classes of input signals. We examine the time complexity of computation for both convolution/correlation and string matching, and explore the possibility of a deterministic algorithm for discrete convolution/correlation.
No takes yet. Share an insight, caveat, or question.
Roy et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: