Topic
complexity class
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.
E is contained in NE, as E is the deterministic-time analogue of the nondeterministic class NE.
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)).
Not who you're looking for? Others named E: New York City Subway service · 2009 studio album by Adrian Belew · 2017 film directed by Kukku Surendran · bus service in Oakland and San Leandro, California
Open questions
On Watch
In the Arcade
Studio characters
