Skip to search formSkip to main contentSkip to account menu

Many-one reduction

Known as: Mapping reduction, M-complete, Many-one 
In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem… 
Wikipedia (opens in a new tab)

Related topics

Related topics

38 relations
AlgorithmArithmetical hierarchyBerman–Hartmanis conjectureClique cover

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Justification of the coupled-mode approximation for a nonlinear elliptic problem with a periodic potential
Coupled-mode systems are used in physical literature to simplify the nonlinear Maxwell and Gross–Pitaevskii equations with a… 
2005
2005
Changes in diffuse phosphorus and nitrogen inputs into surface waters in the Rhine watershed in Switzerland
Abstract.Using the regional scale, nutrient-flow simulation model MODIFFUS, an estimate of phosphorus (P) and nitrogen (N) inputs… 
1995
1995
Sets Computable in Polynomial Time on Average
In this paper, we discuss the complexity and properties of the sets which are computable in polynomial-time on average. This… 
1992
1992
On the Power of One Bit of a P Function
We introduce the class MP of languages L which can be solved in polynomial time with an oracle that returns one bit of a # P… 
1991
1991
On p-Creative Sets and p-Completely Creative Sets
Highly Cited
1986
Highly Cited
1986
Randomness, Relativizations, and Polynomial Reducibilities
We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has… 
Highly Cited
1983
Highly Cited
1983
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
  • Y. Yesha
  • SIAM journal on computing (Print)
  • 1983
  • Corpus ID: 36893080
Let $\Sigma $ be a finite alphabet. A set $S \subset \Sigma ^ * $ is called sparse if the number of members of S having length at… 
Highly Cited
1981
Highly Cited
1981
Completeness, Approximation and Density
Polynomial time approximations to exponential time computable problems (EXP) are considered from the point of view of structure… 
1973
1973
The Representation of Many—One Degrees by the Word Problem for Thue Systems
The object of this paper is to show that, given any total recursive function g, one can effectively construct a Thue system T… 
1970
1970
Turing degrees and many-one degrees of maximal sets
Martin [4, Theorems 1 and 2] proved that a Turing degree a is the degree of a maximal set if, and only if, a′ = 0″. Lachlan has… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)