Time complexity of decision problems or relations among time-bounded complexity classes. (Use [tag:analysis-of-algorithms] 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 , , or for discussion of the time taken by particular algorithms or types of algorithms.

See also related tags and for complexity measures focused on space instead of time.

history | excerpt history