Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00264958n
Noun Named Entity
Categories: Complexity classes
EN
2-EXPTIME  2-EXP  2EXPTIME
EN
In computational complexity theory, the complexity class 2-EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O time, where p is a polynomial function of n. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, the complexity class 2-EXPTIME is the set of all decision problems solvable by a deterministic Turing machine in O time, where p is a polynomial function of n. Wikipedia
Complexity class Wikidata
IS A
complexity class
HAS PART
EXPSPACE
PART OF
ELEMENTARY
NAMED AFTER
two
EXPTIME
Wikipedia
EN
2-EXPTIME
Wikidata
EN
2-EXPTIME
Wikipedia Redirections
EN
2-EXP, 2EXPTIME

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