Expressiveness of modern regular expressions
The word problem of regular expressions with backreferences is NP-complete;
citing Aho (1990) via Blaisorblade/Charles Stewart.

I don't know the whole set of operators some flavors of regexps have, but several are no more powerful than regular; they have probably been added as syntactic sugar.