Faster access than browser!
13 relations: Complexity class, Computational complexity theory, Computational resource, Decision problem, FNP (complexity), FP (complexity), Function problem, L (complexity), Logarithm, NL (complexity), NP (complexity), Time complexity, Turing machine.
Complexity class
In computational complexity theory, a complexity class is a set of problems of related resource-based complexity.
New!!: FL (complexity) and Complexity class · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: FL (complexity) and Computational complexity theory · See more »
Computational resource
In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems.
New!!: FL (complexity) and Computational resource · See more »
Decision problem
In computability theory and computational complexity theory, a decision problem is a problem that can be posed as a yes-no question of the input values.
New!!: FL (complexity) and Decision problem · See more »
FNP (complexity)
In computational complexity theory, the complexity class FNP is the function problem extension of the decision problem class NP.
New!!: FL (complexity) and FNP (complexity) · See more »
FP (complexity)
In computational complexity theory, the complexity class FP is the set of function problems which can be solved by a deterministic Turing machine in polynomial time; it is the function problem version of the decision problem class P. Roughly speaking, it is the class of functions that can be efficiently computed on classical computers without randomization.
New!!: FL (complexity) and FP (complexity) · See more »
Function problem
In computational complexity theory, a function problem is a computational problem where a single output (of a total function) is expected for every input, but the output is more complex than that of a decision problem.
New!!: FL (complexity) and Function problem · See more »
L (complexity)
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space.
New!!: FL (complexity) and L (complexity) · See more »
Logarithm
In mathematics, the logarithm is the inverse function to exponentiation.
New!!: FL (complexity) and Logarithm · See more »
NL (complexity)
In computational complexity theory, NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.
New!!: FL (complexity) and NL (complexity) · See more »
NP (complexity)
In computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.
New!!: FL (complexity) and NP (complexity) · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: FL (complexity) and Time complexity · See more »
Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules.
New!!: FL (complexity) and Turing machine · See more »
Redirects here:
Log space computable function.
