New answers tagged regular-expressions
First, we have to assume a particular PCRE implementation to make "time taken" a well-defined function. We also need to demand that this implementation is "sane", e.g., doesn't deliberately take much longer than necessary (say, exactly Ackermann(m, m) steps). Then, note that even the most naive backtracking takes exponential time in the length of the string....
Top 50 recent answers are included