New research details complexity of regex with backreferences

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

影响 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.

排序理由 Academic paper detailing theoretical computer science research. [lever_c_demoted from research: ic=1 ai=0.7]

在 arXiv cs.CL 阅读 →

• Cloudflare
• Stack Overflow

• 论文
• 安全

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →