 |
 |
|
 |
 |
|
|
|
|
|
|
Encyclopedia :
E :
E( :
E(C :
E (complexity) |
|
|
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.
|
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |
