Theoremresearch
Backurs-Indyk regex matching lower bound
Also called regex matching conditional lower bound.
Under the Orthogonal Vectors hypothesis, regex matching has no O(m^(1-eps) n^(2-delta)) algorithm.
Under the Orthogonal Vectors hypothesis, regex matching has no O(m^(1-eps) n^(2-delta)) algorithm.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZSQ41N Edit this page History Report an error