Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03512052n
Noun Named Entity
SYL
No term available
EN
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O and is therefore equal to the complexity class DTIME. Wikipedia
English:
complexity
Relations
Sources
IS A
EN
complexity class
HAS PART
EN
PSPACE
PART OF
Exptime
EN
NE

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