41 relations: Binary decision diagram, Cambridge University Press, Christos Papadimitriou, Clique (graph theory), Complete (complexity), Complexity class, Computational complexity theory, Computational resource, Computers and Intractability, Connected component (graph theory), Decision problem, Directed graph, DNA, First-order logic, FL (complexity), FO (complexity), Function problem, Graph (mathematics), Graph theory, L/poly, List of unsolved problems in computer science, Log-space reduction, Logarithm, Low (complexity), Michael Sipser, NC (complexity), NL (complexity), Non-deterministic Turing machine, Null (SQL), Omer Reingold, P (complexity), Pointer (computer programming), Query language, Random-access memory, Reachability, Relational algebra, Relational database, SL (complexity), Symposium on Theory of Computing, Transitive closure, Turing machine.

In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function.

New!!: L (complexity) and Binary decision diagram ·

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

New!!: L (complexity) and Cambridge University Press ·

Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949, Athens) is a Greek engineer, computer scientist, and professor of Computer Science at the University of California, Berkeley.

New!!: L (complexity) and Christos Papadimitriou ·

In the mathematical area of graph theory, a clique is subset of vertices of an undirected graph, such that its induced subgraph is complete; that is, every two distinct vertices in the clique are adjacent.

New!!: L (complexity) and Clique (graph theory) ·

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.

New!!: L (complexity) and Complete (complexity) ·

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

New!!: L (complexity) and Complexity class ·

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.

New!!: L (complexity) and Computational complexity theory ·

In computational complexity theory, a computational resource is a resource used by some computational models in the solution of computational problems.

New!!: L (complexity) and Computational resource ·

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson.

New!!: L (complexity) and Computers and Intractability ·

In graph theory, a connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph.

New!!: L (complexity) and Connected component (graph theory) ·

In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer, depending on the values of some input parameters.

New!!: L (complexity) and Decision problem ·

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph, or set of vertices connected by edges, where the edges have a direction associated with them.

New!!: L (complexity) and Directed graph ·

Deoxyribonucleic acid (DNA) is a molecule that carries most of the genetic instructions used in the development, functioning and reproduction of all known living organisms and many viruses.

New!!: L (complexity) and DNA ·

First-order logic is a formal system used in mathematics, philosophy, linguistics, and computer science.

New!!: L (complexity) and First-order logic ·

In computational complexity theory, the complexity class FL is the set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space.

New!!: L (complexity) and FL (complexity) ·

In descriptive complexity, a branch of computational complexity, FO is a complexity class of structures which can be recognized by formulas of first-order logic, and also equals the complexity class AC0.

New!!: L (complexity) and FO (complexity) ·

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, that is, it isn't just YES or NO.

New!!: L (complexity) and Function problem ·

In mathematics, and more specifically in graph theory, a graph is a representation of a set of objects where some pairs of objects are connected by links.

New!!: L (complexity) and Graph (mathematics) ·

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

New!!: L (complexity) and Graph theory ·

In computational complexity theory, L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice.

New!!: L (complexity) and L/poly ·

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

New!!: L (complexity) and List of unsolved problems in computer science ·

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

New!!: L (complexity) and Log-space reduction ·

In mathematics, the logarithm is the inverse operation to exponentiation.

New!!: L (complexity) and Logarithm ·

In computational complexity theory, a complexity class B is said to be low for a complexity class A if AB.

New!!: L (complexity) and Low (complexity) ·

Michael Fredric Sipser (born September 17, 1954) is a theoretical computer scientist who has made early contributions to computational complexity theory.

New!!: L (complexity) and Michael Sipser ·

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.

New!!: L (complexity) and NC (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!!: L (complexity) and NL (complexity) ·

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.

New!!: L (complexity) and Non-deterministic Turing machine ·

Null is a special marker used in Structured Query Language (SQL) to indicate that a data value does not exist in the database.

New!!: L (complexity) and Null (SQL) ·

Omer Reingold (עומר ריינגולד) is a faculty member of the Foundations of Computer Science Group at the Weizmann Institute of Science, Israel.

New!!: L (complexity) and Omer Reingold ·

In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes.

New!!: L (complexity) and P (complexity) ·

In computer science, a pointer is a programming language object, whose value refers to (or "points to") another value stored elsewhere in the computer memory using its address.

New!!: L (complexity) and Pointer (computer programming) ·

Query languages are computer languages used to make queries in databases and information systems.

New!!: L (complexity) and Query language ·

Random-access memory (RAM) is a form of computer data storage.

New!!: L (complexity) and Random-access memory ·

In graph theory, reachability refers to the ability to get from one vertex to another within a graph.

New!!: L (complexity) and Reachability ·

Relational algebra, first described by E.F. Codd while at IBM, is a family of algebra with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.

New!!: L (complexity) and Relational algebra ·

A relational database is a digital database whose organization is based on the relational model of data, as proposed by E.F. Codd in 1970.

New!!: L (complexity) and Relational database ·

In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component.

New!!: L (complexity) and SL (complexity) ·

STOC, the Annual ACM Symposium on Theory of Computing is an academic conference in the field of theoretical computer science.

New!!: L (complexity) and Symposium on Theory of Computing ·

In mathematics, the transitive closure of a binary relation R on a set X is the transitive relation R+ on set X such that R+ contains R and R+ is minimal (Lidl and Pilz 1998:337).

New!!: L (complexity) and Transitive closure ·

A Turing machine is an abstract "machine" that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device.

New!!: L (complexity) and Turing machine ·

## Redirects here:

Deterministic logspace, L (complexity class), L (complexity theory), LOGSPACE, LSPACE, Log space, Logarithmic space, Logspace.