Time complexity of decision problems or relations among time-bounded complexity classes. (Use the [analysis-of-algorithms] tag for the time taken by particular algorithms.)
Time complexity refers to the number of steps required to decide a decision problem or to compute a function, as a function of the input size. Time complexity refers to an inherent property of a problem, and is often used to define complexity classes that are to be compared.
Use instead tags analysis-of-algorithms, amortized-analysis, or smoothed-analysis for discussion of the time taken by particular algorithms or types of algorithms.
See also related tags space-bounded and space-complexity for complexity measures focused on space instead of time.
