Researchers have analyzed the complexity of matching regular expressions with backreferences, a feature that extends traditional regex but increases vulnerability to algorithmic complexity attacks. The paper demonstrates hardness results under the Strong Exponential Time Hypothesis and proves W[2]-hardness for the problem when parameterized by expression length. An improved $O(n \log^2 n)$-time algorithm is presented for 1-use backreferences, a significant enhancement over previous $O(n^2)$ methods. AI
Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →
IMPACT This research delves into the theoretical underpinnings of string matching algorithms, relevant for understanding the robustness of systems that process complex text patterns, including those used in AI.
RANK_REASON Academic paper detailing theoretical computer science research. [lever_c_demoted from research: ic=1 ai=0.7]