Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00264958n
Noun Named Entity
EL
No term available
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
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
EXPSPACE
PART OF
EN
ELEMENTARY
NAMED AFTER
δύο
Exptime

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