Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03512036n
Noun Named Entity
EL
NEXPTIME
EN
In computational complexity theory, the complexity class NEXPTIME is the set of decision problems that can be solved by a non-deterministic Turing machine using time 2 n O {\displaystyle 2^{n^{O}}}. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
Exptime
EN
NE
PART OF
EN
R
EXPSPACE
BabelNet
EL
NEXPTIME

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