E_(complexity) E_(complexity)

E (complexity) - Definition and Overview
Related Words: Convolution, Esoterica, Rigor

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.

Example Usage of (complexity)
VTPG: @RussianPencil at a meta-level, aren't ALL wrist-watches an extra complexity when life forces us to carry phones, etc.?
zecool: RT @republicofmath: Does Louis Armstrong’s voice sound like his trumpet? Music: broken symmetry, geometry & complexity. http://bit.ly/6vUyvL
_ninaevans: 'I think roles that have ambiguity and complexity are the most interesting.' - Stanley Tucci http://bit.ly/76PJue
Copyright 2009 WordIQ.com - Privacy Policy  :: Terms of Use  :: Contact Us  :: About Us
This article is licensed under the GNU Free Documentation License. It uses material from the this Wikipedia article.