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 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...

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

being used (m : many-one reduction, p : polynomial reduction). The mathematical structure generated on a set of problems by the reductions of a particular...

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...

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...

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

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...

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...

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...

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...

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...

There are many many-one reduction used when defining P-completeness, with variable strengths.: Section 3.3  At the lowest level is NC1-reduction, then L-reduction...

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...

forms. For example, it can be shown that there is a polynomial-time many-one reduction that will move all quantifiers to the front of the formula and make...

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

_{\text{PTAS}}{\text{B}}} . With ordinary polynomial-time many-one reductions, if we can describe a reduction from a problem A to a problem B, then any polynomial-time...

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

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...

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...

unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions. E is contained by NE. Allender, E.; Strauss, M. (1994), "Measure...

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

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

1090/s0002-9904-1944-08111-1. Introduces the important concept of many-one reduction. Arithmetical hierarchy Functional completeness List of multiple discoveries...

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

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...

is true for polyL vs NP. One proof that polyL ≠ P is that P has a complete problem under logarithmic space many-one reductions but polyL does not due to...

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...

matrix lowest common ancestor l-reduction Malhotra–Kumar–Maheshwari blocking flow (ru.) Manhattan distance many-one reduction Markov chain marriage problem...