- E (complexity)
In
computational complexity theory , thecomplexity class E is the set ofdecision problem s that can be solved by adeterministic Turing machine in time 2O(n) and is therefore equal to the complexity classDTIME (2O(n)).E is less important to complexity theory than the similar class
EXPTIME because it is not closed underpolynomial-time many-one reduction s.References
* E. Allender and M. Strauss. Measure on small complexity classes with applications for BPP, "Proceedings of IEEE FOCS'94", pp. 807-818, 1994. ECCC [http://eccc.uni-trier.de/eccc-reports/1994/TR94-004/ TR94-004] , DIMACS [http://dimacs.rutgers.edu/TechnicalReports/abstracts/1994/94-18.html TR 94-18] .
* R. Book. On languages accepted in polynomial time, "SIAM Journal on Computing" 1(4):281-287, 1972.
* R. Book. Comparing complexity classes, "Journal of Computer and System Sciences" 3(9):213-229, 1974.
* R. Impagliazzo and G. Tardos. Decision versus search problems in super-polynomial time, in "Proceedings of IEEE FOCS 1989", pp. 222-227, 1989.
* O. Watanabe. Comparison of polynomial time completeness notions, "Theoretical Computer Science" 53:249-265, 1987.External links
* [http://qwiki.caltech.edu/wiki/Complexity_Zoo#e E] at the Complexity Zoo
Wikimedia Foundation. 2010.