Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03512052n
Noun Named Entity
Categories: Complexity classes, Theoretical computer science stubs
EN
E
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
Definitions
Relations
Sources
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
A set of decision problems solvable by a Turing machine in a specific time Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
HAS PART
PSPACE
PART OF
EXPTIME
NE
Wikipedia
EN
E (complexity)
Wikidata
EN
E

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