Time and space complexity for boost regex_match

In boost C++,there is something called regex_match.I would like to know what is the time complexity and space comlexity of this function. On their website it is mentioned that regex_match throws an exception if the time taken to match against a string exceeds O(N^2). So should we assume that worst case time complexity is O(N^2). What about best case and average case?