Tighter Upper Bounds on the Exact Complexity of String Matching
From MaRDI portal
Publication:4340774
DOI10.1137/S009753979324694XzbMath0870.68116OpenAlexW4251905599MaRDI QIDQ4340774
Ramesh Hariharan, Richard John Cole
Publication date: 12 June 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979324694x
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Computing methodologies for text processing; mathematical typography (68U15)
Related Items