Complexity Theory is part of the theory of computation dealing with the resources required during computation to solve a given problem. The most common resources are time (how many steps does it take to solve a problem) and space (how much memory does it take to solve a problem). Other resources can also be considered, such as how many parallel processors are needed to solve a problem in parallel. Complexity theory differs from computability theory, which deals with whether a problem can be solved at all, regardless of the resources required.
A single "problem" is an entire set of related questions, where each question is a finitelength string. For example, the problem FACTORIZE is: given an integer written in binary, return all of the prime factors of that number. A particular question is called an instance. For example, "give the factors of the number 15" is one instance of the FACTORIZE problem.
The time complexity of a problem is the number of steps that it takes to solve an instance, as a function of the size of the instance. If an instance that is n bits long can be solved in n^{2} steps, then we say it has a time complexity of n^{2}. Of course, the exact number of steps will depend on exactly what machine or language is being used. To avoid that problem, we generally use Big O notation. If a problem has time complexity O(n^{2}) on one typical computer, then it will also have complexity O(n^{2}) on most other computers, so this notation allows us to generalize away from the details of a particular computer.
Much of complexity theory deals with decision problems. A decision problem is a problem where the answer is always YES/NO. For example, the problem ISPRIME is: given an integer written in binary, return whether it is a prime number or not. A decision problem is equivalent to a language, which is a set of finitelength strings. For a given decision problem, the equivalent language is the set of all strings for which the answer is YES.
Decision problems are often considered because an arbitrary problem can always be reduced to a decision problem. For example, the problem HASFACTOR is: given integers n and k written in binary, return whether n has any prime factors less than k. If we can solve HASFACTOR with a certain amount of resources, then we can use that solution to solve FACTORIZE without much more resources. Just do a binary search on k until you find the smallest factor of n. Then divide out that factor, and repeat until you find all the factors.
Complexity theory often makes a distinction between YES answers and NO answers. For example, the set NP is defined as the set of problems where the YES instances can be checked quickly. The set CoNP is the set of problems where the NO instances can be checked quickly. The "Co" in the name stands for "complement". The complement of a problem is one where all the YES and NO answers are swapped, such as ISCOMPOSITE for ISPRIME.
The set P is the set of decision problems that can be solved by a deterministic machine in polynomial time. The set NP is the set of decision problems that can be solved by a nondeterministic machine in polynomial time. The question of whether P is the same set as NP is the most important open question in theoretical computer science. There is even a $1,000,000 prize for solving it. (See Complexity classes P and NP and oracles).
Questions like this motivate the concepts of hard and complete. A set of problems X is hard for a set of problems Y if every problem in Y can be transformed easily into some problem in X with the same answer. The definition of "easily" is different in different contexts. The most important hard set is NPhard. Set X is complete for Y if it is hard for Y, and is also a subset of Y. The most important complete set is NPcomplete. See the articles on those two sets for more detail on the definition of "hard" and "complete".
The following are some of the classes of problems considered in complexity theory, along with rough definitions. See computation for a chart showing which classes are subsets of other classes.
P  Solvable in polynomial time (see Complexity classes P and NP)  
NP  YES answers checkable in polynomial time (see Complexity classes P and NP)  
CoNP  NO answers checkable in polynomial time  
NPcomplete  The hardest problems in NP  
CoNPcomplete  The hardest problems in CoNP  
NPhard  Either NPcomplete or harder  
NPeasy  nondecisionproblem analogue to NP  
NPequivalent  nondecisionproblem analogue to NPcomplete  
#P  Count solutions to an NP problem  
#Pcomplete  The hardest problems in #P  
NC  Solvable efficiently on parallel computers  
Pcomplete  The hardest problems in P to solve on parallel computers  
PSPACE  Solvable with polynomial memory and unlimited time  
PSPACEcomplete  The hardest problems in PSPACE  
EXPTIME  Solvable with exponential time  
EXPSPACE  Solvable with exponential memory and unlimited time  
BQP  Solvable in polynomial time on a quantum computer (answer is probably right)  
BPP  Solvable in polynomial time by randomized algorithms (answer is probably right)  
RP  Solvable in polynomial time by randomized algorithms (NO answer is probably right, YES is certainly right)  
ZPP  Solvable by randomized algorithms (answer is always right, average running time is polynomial) 
In computing the complexity of an algorithm is a formal notion to describe its "speed". However, the important thing is not the actual execution time (e.g. in seconds), because this would depend on the special implementation and the computational power of the used computer, but on how it depends on a certain input value. Mostly, this input value is the size of the input data.
Example: Mowing grass has linear complexity because it takes double the time to mow the double area. However, looking up something in a dictionary has only logarithmic complexity because for a double sized dictionary you have to open it only one time more (e.g. exactly in the middle  then the problem is reduced to the half).
Sometimes, not the timing of an algorithm is the subject but the memory demand or the demand for any other resource.
For a mathematical formulation, the big O notation is used. For instance, O(N) means linear complexity, O(N^{2}) means quadratic complexity.
Search Encyclopedia

Featured Article
