A many-one reduction is a total computable satisfying exactly when .
Two sets have the same many-one degree when each many-one reduces to the other.
A staged-enumeration reduction controls an output language by enumerating more elements at each simulation stage and changing behavior when a source computation halts.
A set is complete for a class under many-one reductions when and every satisfies .

Ancestors (5)

  1. Computability theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

Synonyms (1)

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Many-one reduction, also known as **mapping reduction**, is a concept in computational complexity theory used to compare the difficulty of decision problems. It involves transforming instances of one decision problem into instances of another decision problem in such a way that the answer to the original problem can be easily derived from the answer to the transformed problem.