Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346477n
Noun Named Entity
Categories: Articles with short description, Complexity classes
EN
EXPTIME  APSPACE  DEXPTIME  EXP  exponential running time
EN
In computational complexity theory, the complexity class EXPTIME is the set of all decision problems that are solvable by a deterministic Turing machine in exponential time, i.e., in O time, where p is a polynomial function of n. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, the complexity class EXPTIME is the set of all decision problems that are solvable by a deterministic Turing machine in exponential time, i.e., in O time, where p is a polynomial function of n. Wikipedia
A complexity class in computing Wikipedia Disambiguation
IS A
complexity class
HAS PART
E
PART OF
ESPACE
NEXPTIME
Wikipedia
EN
EXPTIME
Wikidata
EN
EXPTIME
Wikipedia Redirections
EN
APSPACE, DEXPTIME, EXP, exponential running time, Exponential runtime, EXPTIME-complete
Wikidata Alias
EN
Exponential Time

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