39 relations: Binary decision diagram, Cambridge University Press, 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 (discrete mathematics), Graph theory, L/poly, List of unsolved problems in computer science, Log-space reduction, Logarithm, Low (complexity), 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.
Cambridge University Press (CUP) is the publishing business of the University of Cambridge.
In the mathematical area of graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is complete.
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.
In computational complexity theory, a complexity class is a set of problems of related resource-based 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, a computational resource is a resource used by some computational models in the solution of computational problems.
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.
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.
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.
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.
Deoxyribonucleic acid (DNA) is a thread-like chain of nucleotides carrying the genetic instructions used in the growth, development, functioning and reproduction of all known living organisms and many viruses.
First-order logic—also known as first-order predicate calculus and predicate logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science.
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.
In descriptive complexity, a branch of computational complexity, FO is a complexity class of structures that can be recognized by formulas of first-order logic, and also equals the complexity class AC0.
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.
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".
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
In computational complexity theory, L/poly is the complexity class of logarithmic space machines with a polynomial amount of advice.
This article is a 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.
In mathematics, the logarithm is the inverse function to exponentiation.
In computational complexity theory, a language B (or a complexity class B) is said to be low for a complexity class A (with some reasonable relativized version of A) if AB.
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.
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.
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.
Null (or NULL) is a special marker used in Structured Query Language to indicate that a data value does not exist in the database.
Omer Reingold (עומר ריינגולד) is a faculty member of the Computer Science Department at Stanford University.
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
In computer science, a pointer is a programming language object that stores the memory address of another value located in computer memory.
Query languages or data query languages (DQLs) are computer languages used to make queries in databases and information systems.
Random-access memory (RAM) is a form of computer data storage that stores data and machine code currently being used.
In graph theory, reachability refers to the ability to get from one vertex to another within a graph.
Relational algebra, first created by Edgar F. Codd while at IBM, is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it.
A relational database is a digital database based on the relational model of data, as proposed by E. F. Codd in 1970.
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.
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science.
In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive.
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.