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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
051019712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • Arno Pauly
  • Mathematical Structures in Computer Science
  • 2017
Many-one reductions between search problems (i.e. multi-valued functions) play a crucial part in both algorithmic game theory… (More)
Is this relevant?
2013
2013
Prognostics and Health Management (PHM) of rotating machines is gaining importance in industry and allows increasing reliability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small… (More)
Is this relevant?
2003
2003
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic… (More)
Is this relevant?
2003
2003
Razborov (1994) proved that existence of an optimal proof system implies existence of a many-one complete disjoint NP-pair… (More)
Is this relevant?
1999
1999
This work introduces the concept of an M-complete approximate identity (M-cai) for a given operator subspace X of an operator… (More)
Is this relevant?
1997
1997
We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock… (More)
Is this relevant?
1997
1997
We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal et al. (1998). In that paper… (More)
Is this relevant?
1984
1984
Warteschlangensysteme, bei denen Ankünfte und Abgänge aus dem System einen Poisson-Prozeß bilden, heißen M-vollständig (siehe M… (More)
Is this relevant?
1974
1974
 
Is this relevant?