
related topics 
{math, number, function} 
{theory, work, human} 
{system, computer, user} 
{rate, high, increase} 
{acid, form, water} 

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer. Informally, a computational problem consists of problem instances and solutions to these problem instances. For example, primality testing is the problem of determining whether a given number is prime or not. The instances of this problem are natural numbers, and the solution to an instance is yes or no based on whether the number is prime or not.
A problem is regarded as inherently difficult if solving the problem requires a large amount of resources, whatever the algorithm used for solving it. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and quantifying the amount of resources needed to solve them, such as time and storage. Other complexity measures are also used, such as the amount of communication (used in communication complexity), the number of gates in a circuit (used in circuit complexity) and the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what computers can and cannot do.
Closely related fields in theoretical computer science are analysis of algorithms and computability theory. A key distinction between computational complexity theory and analysis of algorithms is that the latter is devoted to analyzing the amount of resources needed by a particular algorithm to solve a problem, whereas the former asks a more general question about all possible algorithms that could be used to solve the same problem. More precisely, it tries to classify problems that can or cannot be solved with appropriately restricted resources. In turn, imposing restrictions on the available resources is what distinguishes computational complexity from computability theory: the latter theory asks what kind of problems can be solved in principle algorithmically.
Contents
Full article ▸


related documents 
Topological space 
Collatz conjecture 
Markov chain 
Zermeloâ€“Fraenkel set theory 
Matrix multiplication 
Peano axioms 
Limit superior and limit inferior 
Naive set theory 
Inverse function 
Recurrence relation 
Finite field 
Recursion 
Word problem for groups 
Cantor set 
Binary search tree 
Hash table 
Inner product space 
Elliptic curve cryptography 
Addition 
LR parser 
Limit (category theory) 
Pythagorean theorem 
Pi 
Wavelet 
Mathematical induction 
Calculus 
Numeral system 
Braket notation 
Groupoid 
Cauchy sequence 
