Cart (0)Free Online Dictionary
E (complexity)
| Wikipedia English The Free Encyclopedia |  Download this dictionary |
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 2O(n) and is therefore equal to the complexity class DTIME(2O(n)).
| See more at Wikipedia.org... |
© This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License and under the Creative Commons Attribution-ShareAlike License
| E (complexity) in German
You think you have ethics...
Take the survey NOW!