E (complexity)

The complexity class is the class of all languages ​​that can be solved by a deterministic Turing machine in exponential time with linear exponent. There exists, therefore, for each a Turing machine with a time limit for an arbitrary, so for all the machine accepts the word in at most steps.

The class plays in complexity theory an important role since it is not complete as EXPTIME under Polynomialzeitreduktion. Because so we can conclude: PSPACE. While it is known for: , is too well known for any relation.