I have an algorithm whose time complexity is O(n^c), where c ≥ 4 (and c is an integer).

Per the Time Complexity's Wikipedia page's Table of common time complexities, they do not list this case.

What is the nickname for this time complexity?

Edit: I am interested in the name for keeping c as a variable (basically a natural number ≥ 4), not so much a particular c = 7 or c = 42.

CodePudding user response：

Generally, any n^c for integer c is called a polynomial time complexity. It matches with the polynomial class of problem as well and is denoted by P. Here is the time complexity class.

CodePudding user response：

Wikipedia lists quartic, quintic, sextic, septic for degrees 4 to 7, and says names for some higher degrees have been proposed but are rarely used.