In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problemâ€¦Â (More)

(More)

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

- Tarak Benkedjouh, Kamal Medjaher, Noureddine Zerhouni, SaÃ¯d Rechak
- Eng. Appl. of AI
- 2013

Prognostics and Health Management (PHM) of rotating machines is gaining importance in industry and allows increasing reliabilityâ€¦Â (More)

Is this relevant?

2007

2007

- Eraldo Giuli, Walter Tholen
- Applied Categorical Structures
- 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

- Timothy J. Long
- 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

- Christian GlaÃŸer, Alan L. Selman, Samik Sengupta
- Proceedings. 19th IEEE Annual Conference onâ€¦
- 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

- A. Arias, Hinda Rosenthal
- 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

- Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
- computational complexity
- 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

- Hans Tzschach
- Computing
- 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