34 relations: Algorithm, Arthur–Merlin protocol, Complete (complexity), Complexity class, Computational complexity theory, Crossing number (graph theory), Decision problem, Existential theory of the reals, EXPTIME, Graph (discrete mathematics), Graph isomorphism problem, International Symposium on Graph Drawing, Karp's 21 NP-complete problems, L (complexity), Log-space reduction, Many-one reduction, NC (complexity), NL (complexity), NP (complexity), NP-completeness, NP-hardness, P (complexity), P-complete, Polynomial hierarchy, PSPACE, PSPACE-complete, Reduction (complexity), Richard M. Karp, Stephen Cook, Subroutine, Time complexity, Truth table, Truth-table reduction, Turing reduction.
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
In computational complexity theory, an Arthur–Merlin protocol is an interactive proof system in which the verifier's coin tosses are constrained to be public (i.e. known to the prover too).
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 graph theory, the crossing number of a graph is the lowest number of edge crossings of a plane drawing of the graph.
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 mathematical logic, computational complexity theory, and computer science, the existential theory of the reals is the set of all true sentences of the form where F(X_1,\dots X_n) is a quantifier-free formula involving equalities and inequalities of real polynomials.
In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that have exponential runtime, i.e., that are solvable by a deterministic Turing machine in O(2p(n)) time, where p(n) is a polynomial function of n. In terms of DTIME, We know and also, by the time hierarchy theorem and the space hierarchy theorem, that so at least one of the first three inclusions and at least one of the last three inclusions must be proper, but it is not known which ones are.
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".
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.
The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present peer reviewed papers on graph drawing, information visualization of network information, geometric graph theory, and related topics.
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete.
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.
In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space.
In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem into instances of a second decision problem.
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 computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
In complexity theory, a decision problem is P-complete (complete for the complexity class '''P''') if it is in P and every problem in P can be reduced to it by an appropriate reduction.
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines.
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.
New!!: Polynomial-time reduction and PSPACE ·
In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial space) and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time.
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem.
Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley.
Stephen Arthur Cook, (born December 14, 1939) is an American-Canadian computer scientist and mathematician who has made major contributions to the fields of complexity theory and proof complexity.
In computer programming, a subroutine is a sequence of program instructions that performs a specific task, packaged as a unit.
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
A truth table is a mathematical table used in logic—specifically in connection with Boolean algebra, boolean functions, and propositional calculus—which sets out the functional values of logical expressions on each of their functional arguments, that is, for each combination of values taken by their logical variables (Enderton, 2001).
In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another.
In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already known (Rogers 1967, Soare 1987).