**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, and relating those classes to each other. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer (*i.e.* the problem can be stated by a set of mathematical instructions). 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 its solution requires significant resources, whatever the algorithm used. 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 analysis of algorithms and computational complexity theory is that the former is devoted to analyzing the amount of resources needed by a particular algorithm to solve a problem, whereas the latter 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, in principle, be solved algorithmically.

Read more about Computational Complexity Theory: Intractability, Continuous Complexity Theory, History

### Other articles related to "computational complexity theory, complexity, computational complexity, computational, theory":

**Computational Complexity Theory**- History

... Before the actual research explicitly devoted to the

**complexity**of algorithmic problems started off, numerous foundations were laid out by various researchers. 2003) date the beginning of systematic studies in

**computational complexity**to the seminal paper "On the

**Computational Complexity**of Algorithms" by Juris Hartmanis and Richard Stearns (1965 ... Trakhtenbrot (1956), a pioneer in the field from the USSR, studied another specific

**complexity**measure ...

... dynamical systems) Savitch's theorem (

**computational complexity theory**) Sazonov's theorem (functional analysis) Schaefer's dichotomy theorem (

**computational complexity**...

... Once the Cartesian individual is dissolved, the social sciences will move away from a subject-centered view of the world ... The challenge is then how to non-represent empirical reality without reducing the complexity of a system ...

... Lowering the costs of

**complexity**in one sphere causes them to rise in another." "Industrialism illustrates this point ... It generated its own problems of

**complexity**and costliness ... While such elements of

**complexity**are usually thought to facilitate economic growth, in fact they can do so only when subsidized by energy." (italics ours) ...

... procedure but do not otherwise limit the

**computational**resources available ... This is acceptable in the study of recursion

**theory**, which is interested in theoretical computability, but it is not reasonable for

**computational complexity theory**, which studies which sets can be decided ... The most common reducibility in

**computational complexity theory**is polynomial-time reducibility a set A is polynomial-time reducible to a set B if there is a ...

### Famous quotes containing the words theory and/or complexity:

“The things that will destroy America are prosperity-at-any- price, peace-at-any-price, safety-first instead of duty-first, the love of soft living, and the get-rich-quick *theory* of life.”

—Theodore Roosevelt (1858–1919)

“The price we pay for the *complexity* of life is too high. When you think of all the effort you have to put in—telephonic, technological and relational—to alter even the slightest bit of behaviour in this strange world we call social life, you are left pining for the straightforwardness of primitive peoples and their physical work.”

—Jean Baudrillard (b. 1929)