E (complexity)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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(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.


External links[edit]