Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology

Complexity theory

Blum axioms
Axioms in computational complexity theory
Blum's speedup theorem
Rules out assigning to arbitrary functions their computational complexity
Boolean satisfiability problem
Problem of determining if a Boolean formula could be made true
Chain rule for Kolmogorov complexity
Lower bound for size of software program
Computational complexity theory
Study of inherent difficulty of computational problems
Constructible function
Function whose values can be computed in a number of steps or a number of Turing-machine cells of order given by the function itself
Gap theorem
There are arbitrarily large computable gaps in the hierarchy of complexity classes
Kolmogorov complexity
Measure of algorithmic complexity
Kolmogorov structure function
Statistical function
NP (complexity)
Complexity class used to classify decision problems
NP-hardness
Complexity class
P (complexity)
Class of problems solvable in polynomial time
P versus NP problem
Unsolved problem in computer science
Space complexity
Amount of memory space that an algorithm uses as a function of the input's size
Space hierarchy theorem
Both deterministic and nondeterministic machines can solve more problems given more space
Time complexity
Estimate of time taken for running an algorithm
Time hierarchy theorem
Given more time, a Turing machine can solve more problems