Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02984369n
Noun Concept
EL
No term available
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
Relations
Sources
IS A
μείωση turing

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