Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03452766n
Noun Concept
ES
No term available
EN
In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently. Wikipedia
Relations
Sources
IS A
conjetura
HAS KIND
toma de decisiones diffie-hellman supuesto
problema RSA
EN
computational Diffie–Hellman assumption
EN
decisional composite residuosity assumption
hipótesis de tiempo exponencial
HAS INSTANCE
problema RSA
logaritmo discreto
problema subgrupo oculto
FIELD OF WORK
criptografía

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