Science Fair Project Encyclopedia
E (complexity)
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 O(kn) for some k.
E is less important to complexity theory than the similar class EXPTIME because it is not closed under polynomial-time many-one reductions.
Last updated: 05-07-2005 16:22:07
12-19-2008 14:25:18
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


