The journal
Open the journal →The conversation starts in the journal — be the first to post.
About E
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)).
Everything about E →