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

polynomial-time reduction, from the most to the least restrictive, are polynomial-time many-one reductions, truth-table reductions, and Turing reductions. The most...

polynomial-time reductions. Log-space reductions are normally used on languages in P, in which case it usually does not matter whether many-one reductions or Turing...

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

term reduction was used in the technical meaning of a polynomial-time many-one reduction. Another type of reduction is polynomial-time Turing reduction. A...

{\displaystyle B\leq _{T}A} . The reductions presented here are not only Turing reductions but many-one reductions, discussed below. Every set is Turing...

a polynomial-time many-one reduction from L to H.: 80  Another definition is to require that there be a polynomial-time reduction from an NP-complete...

the current definition of NP-completeness (i.e., by polynomial-time many-one reduction). Cook and Karp each received a Turing Award for this work. The theoretical...

called the Cook-Levin theorem) to show that there is a polynomial time many-one reduction from the boolean satisfiability problem to each of 21 combinatorial...

Redox (/ˈrɛdɒks/ RED-oks, /ˈriːdɒks/ REE-doks, reduction–oxidation or oxidation–reduction: 150 ) is a type of chemical reaction in which the oxidation...

that reductionism is "one of the most used and abused terms in the philosophical lexicon" and suggests a three-part division: Ontological reductionism: a...

These reductions may also be called polynomial many-one counting reductions or weakly parsimonious reductions; they are analogous to many-one reductions for...

a polynomial-time many-one reduction to it. In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the...

In the iron and steel industry, direct reduction is a set of processes for obtaining iron from iron ore, by reducing iron oxides without melting the metal...

for an example. The definition of NP-easy uses a Turing reduction rather than a many-one reduction because the answers to problem Y are only TRUE or FALSE...

{\displaystyle A\leq _{\text{P}}B} means that there is a polynomial-time many-one reduction from A to B. PSPACE-complete problems are of great importance to studying...

are said to be many-one equivalent (or m-equivalent). Many-one reductions are "stronger" than Turing reductions: if a set A is many-one reducible to a...

Noise reduction is the process of removing noise from a signal. Noise reduction techniques exist for audio and images. Noise reduction algorithms may distort...

NP-complete. This can be proved either by a many-one reduction from 3-satisfiability, or by a parsimonious reduction from the closely related Hamiltonian path...

is in EXPTIME, and every problem in EXPTIME has a polynomial-time many-one reduction to it. A number of problems are known to be EXPTIME-complete. Because...

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

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

this reduction is more liberal than the standard reduction used in computational complexity (sometimes called polynomial-time many-one reduction); for...

Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the...

Reduction mammoplasty (also breast reduction and reduction mammaplasty) is the plastic surgery procedure for reducing the size of large breasts. In a breast...

NP-complete, this polynomial-time many-one reduction shows that subgraph isomorphism is also NP-complete. An alternative reduction from the Hamiltonian cycle...

Redox potential (also known as oxidation / reduction potential, ORP, pe, E r e d {\displaystyle E_{red}} , or E h {\displaystyle E_{h}} ) is a measure...

origin, and does not appear in Tutte's paper. Many NP-completeness proofs are based on many-one reductions from 3-satisfiability, the problem of finding...

Lambda calculus consists of constructing lambda terms and performing reduction operations on them. In the simplest form of lambda calculus, terms are...

a polynomial-time many-one reduction to it. In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the...