Computational complexity theory and L (complexity)

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Computational complexity theory and L (complexity)

Computational complexity theory vs. L (complexity)

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. 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.

Cambridge University Press

Cambridge University Press (CUP) is the publishing business of the University of Cambridge.

Cambridge University Press and Computational complexity theory · Cambridge University Press and L (complexity) · See more »

Complete (complexity)

In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardest" (or "most expressive") problems in the complexity class.

Complete (complexity) and Computational complexity theory · Complete (complexity) and L (complexity) · See more »

Complexity class

In computational complexity theory, a complexity class is a set of problems of related resource-based complexity.

Complexity class and Computational complexity theory · Complexity class and L (complexity) · 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.

Computational complexity theory and Decision problem · Decision problem and L (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.

Computational complexity theory and Function problem · Function problem and L (complexity) · See more »

Graph (discrete mathematics)

In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".

Computational complexity theory and Graph (discrete mathematics) · Graph (discrete mathematics) and L (complexity) · See more »

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.

Computational complexity theory and Graph theory · Graph theory and L (complexity) · See more »

List of unsolved problems in computer science

This article is a list of unsolved problems in computer science.

Computational complexity theory and List of unsolved problems in computer science · L (complexity) and List of unsolved problems in computer science · See more »

Log-space reduction

In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space.

Computational complexity theory and Log-space reduction · L (complexity) and Log-space reduction · See more »

NC (complexity)

In complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors.

Computational complexity theory and NC (complexity) · L (complexity) and NC (complexity) · 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.

Computational complexity theory and NL (complexity) · L (complexity) and NL (complexity) · See more »

Non-deterministic Turing machine

In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers.

Computational complexity theory and Non-deterministic Turing machine · L (complexity) and Non-deterministic Turing machine · See more »

P (complexity)

In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.

Computational complexity theory and P (complexity) · L (complexity) and P (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.

Computational complexity theory and Turing machine · L (complexity) and Turing machine · See more »