Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02984369n
Noun Concept
Categories: Reduction (complexity)
EN
many-one reduction  m-complete  M reduction  many-one  many-one reducible
EN
In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem to another decision problem using an effective function. Wikipedia
Definitions
Relations
Sources
EN
In computability theory and computational complexity theory, a many-one reduction is a reduction which converts instances of one decision problem to another decision problem using an effective function. Wikipedia
Type of Turing reduction Wikidata
IS A
Turing reduction
Wikipedia
EN
many-one reduction
Wikidata
EN
many-one reduction
Wikipedia Redirections
EN
m-complete, many-one, many-one reducible, Many-to-one reduction, Mapping reducibility, mapping reduction
Wikidata Alias
EN
M reduction, many-to-one reduction, mapping reduction

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License