b-SMBG admits near-linear time for b=3, is combinatorially hard for b≥4, has a conditionally optimal matrix-multiplication algorithm for constant b, and is SETH-hard for b=ω(log|V|).
Title resolution pending
1 Pith paper cite this work, alongside 68 external citations. Polarity classification is still indexing.
1
Pith paper citing it
68
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
String Matching in (Block) Graphs: A Full Classification by Walk Length
b-SMBG admits near-linear time for b=3, is combinatorially hard for b≥4, has a conditionally optimal matrix-multiplication algorithm for constant b, and is SETH-hard for b=ω(log|V|).