bn:03512052n
Noun Named Entity
Categories: Theoretical computer science stubs, Complexity classes
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
Wikipedia
Wikidata
EN
E