Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03233939n
Noun Named Entity
EL
No term available
EN
In computational complexity theory, the complexity class TFNP is the class of total function problems which can be solved in nondeterministic polynomial time. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
EN
PPP
EN
PPA
EN
PLS
PART OF
EN
FNP

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