Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03512036n
Noun Named Entity
Categories: Complexity classes
EN
NEXPTIME  NEXP
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
Definitions
Relations
Sources
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
Complexity class Wikidata
IS A
complexity class
HAS PART
EXPTIME
NE
PART OF
R
EXPSPACE
Wikipedia
EN
NEXPTIME
Wikidata
EN
NEXPTIME
Wikipedia Redirections
EN
NEXP

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