computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently efficient reduction from one...

In computational complexity theory, a polynomial-time reduction is a method for solving one problem using another. One shows that if a hypothetical subroutine...

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

types of reductions, based on the method of reduction, such as Cook reductions, Karp reductions and Levin reductions, and the bound on the complexity of reductions...

the program implementing the Turing reduction may use. These limits on the computational complexity of the reduction are important when studying subrecursive...

computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances of one decision...

In the computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction (a transformation from one problem...

organic compounds Ore reduction: see smelting Reduction (complexity), a transformation of one problem into another problem Reduction (recursion theory),...

first-order reduction is a very strong type of reduction between two computational problems in computational complexity theory. A first-order reduction is a...

the complexity class. More formally, a problem p is called hard for a complexity class C under a given type of reduction if there exists a reduction (of...

Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent...

computational complexity theory and game complexity, a parsimonious reduction is a transformation from one problem to another (a reduction) that preserves...

theory and computational complexity theory, especially the study of approximation algorithms, an approximation-preserving reduction is an algorithm for transforming...

computational complexity of decision problems. The term L reduction is sometimes used to refer to log-space reductions, by analogy with the complexity class L...

different concepts for different degrees of complexity while affirming a reduction of theories. The idea of reductionism can be expressed by "levels" of explanation...

problems Reduction (complexity) Unknowability Leeuwen, Jan van, ed. (1998). Handbook of Theoretical Computer Science. Vol. A, Algorithms and complexity. Amsterdam:...

In computational complexity theory, a PTAS reduction is an approximation-preserving reduction that is often used to perform reductions between solutions...

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly...

(although this has not been proven). The closure of any complexity class under Turing reductions is a superset of that class which is closed under complement...

similar class NEXPTIME, is not closed under polynomial-time many-one reductions. NE is contained by NEXPTIME. E (complexity) Complexity Zoo: NE v t e...

In computational complexity theory, L (also known as LSPACE, LOGSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved...

In computational complexity theory, a fine-grained reduction is a transformation from one computational problem to another, used to relate the difficulty...

equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions. E is contained...

In computability theory a truth-table reduction is a type of reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle...

In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated...

In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t...

Model order reduction (MOR) is a technique for reducing the computational complexity of mathematical models in numerical simulations. As such it is closely...

In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as inputs...

taken into account. Lists of problems List of unsolved problems Reduction (complexity) Unknowability Wells, J. B. (1993). "Typability and type checking...

Karp's 21 NP-complete problems List of PSPACE-complete problems Reduction (complexity) Grigoriev & Bodlaender (2007). Karp (1972) Garey & Johnson (1979)...