Computational complexity

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, the computational complexity or simply complexity of an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> is the amount of resources required to run it. Particular focus is given to <a href="/facts/Time_complexity/77T62gmf">computation time</a> (generally measured by the number of needed elementary operations) and <a href="/facts/Space_complexity/nsnAW5cV">memory storage</a> requirements. The complexity of a <a href="/facts/Computational_problem/jQ7bYUVh">problem</a> is the complexity of the best algorithms that allow solving the problem.
The study of the complexity of explicitly given algorithms is called <a href="/facts/Analysis_of_algorithms/pStoBgBn">analysis of algorithms</a>, while the study of the complexity of problems is called <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a>. Both areas are highly related, as the complexity of an algorithm is always an <a href="/facts/Upper_bound/YJje9oC2">upper bound</a> on the complexity of the problem solved by this algorithm. Moreover, for designing efficient algorithms, it is often fundamental to compare the complexity of a specific algorithm to the complexity of the problem to be solved. Also, in most cases, the only thing that is known about the complexity of a problem is that it is lower than the complexity of the most efficient known algorithms. Therefore, there is a large overlap between analysis of algorithms and complexity theory.
As the amount of resources required to run an algorithm generally varies with the size of the input, the complexity is typically expressed as a function n → f(n), where n is the size of the input and f(n) is either the <a href="/facts/Worst-case_complexity/kqzQkwIc">worst-case complexity</a> (the maximum of the amount of resources that are needed over all inputs of size n) or the <a href="/facts/Average-case_complexity/6TqLIMMz">average-case complexity</a> (the average of the amount of resources over all inputs of size n). <a href="/facts/Time_complexity/77T62gmf">Time complexity</a> is generally expressed as the number of required elementary operations on an input of size n, where elementary operations are assumed to take a constant amount of time on a given computer and change only by a constant factor when run on a different computer. <a href="/facts/Space_complexity/nsnAW5cV">Space complexity</a> is generally expressed as the amount of <a href="/facts/Computer_memory/hQKVQ51J">memory</a> required by an algorithm on an input of size n.

Computational complexity open-in-new

Computational complexity