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.
2015
2015
Evaluating the Regional Benefit/Cost Ratio for Transit State of Good Repair Investments
Should transit operators focus scarce funding on maintaining current systems in a state of good repair (SGR), or on expanding… 
Review
2008
Review
2008
Upper Semilattices in Many-One Degrees
The paper gives an overview over recent results of the author on various upper semilattices of many-one degrees. The local… 
2008
2008
On Bounded Integer Programming
We present an efficient reduction from the Bounded integer programming (BIP) to the Subspace avoiding problem (SAP) in lattice… 
Review
2006
Review
2006
Evaluation of agricultural nutrient reductions in restored riparian buffers
Title of dissertation: EVALUATION OF AGRICULTURAL NUTRIENT REDUCTIONS IN RESTORED RIPARIAN BUFFERS Adrienne J. Sutton, Doctor of… 
2006
2006
Cognitive Deficits and Structural Brain Changes Associated with Dementia and Visual Hallucinations in Parkinson's Disease
Cognitive impairment of different degrees and hallucinations are common complications of chronic Parkinsons disease (PD). The… 
2005
2005
Bounded color multiplicity graph isomorphism is in the #L hierarchy
In this paper we study the complexity of bounded color multiplicity graph isomorphism BCGI/sub b/: the input is a pair of vertex… 
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
Algebraic lattices as congruence lattices: The m-complete case
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… 
Review
1973
Review
1973
Many-one degrees associated with problems of tag
Tag systems were defined by Post [9], [10] and have been studied by a number of researchers including Minsky [7], Maslov [6] and… 
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)