(mathematics, computer science) A theory focusing on classifying computational problems according to their resource usage, and relating these classes to each other.

The following tables list the computational complexity of various algorithms for common mathematical operations.

In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed.

In computational complexity theory, asymptotic computational complexity is the usage of asymptotic analysis for the estimation of computational complexity of algorithms and computational problems, commonly associated with the usage of the big O notation.