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 2 O(n) and is therefore equal to the complexity class DTIME(2O(n)).
E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.
![]() | This section has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these messages)
|
E is contained by NE.