Editing E (complexity) (section)

== References ==
*{{citation|first1=E.|last1=Allender|first2=M.|last2=Strauss|contribution=Measure on small complexity classes with applications for BPP|title=[[Symposium on Foundations of Computer Science|Proceedings of IEEE FOCS'94]]|year=1994|pages=807–818|id={{ECCC|1994|94|004}}, DIMACS [http://dimacs.rutgers.edu/TechnicalReports/abstracts/1994/94-18.html TR 94-18]}}.
*{{citation|first=R.|last=Book|title=On languages accepted in polynomial time|journal=[[SIAM Journal on Computing]]|volume=1|issue=4|pages=281–287|year=1972|doi=10.1137/0201019}}.
*{{citation|first=R.|last=Book|title=Comparing complexity classes|journal=Journal of Computer and System Sciences|volume=3|issue=9|pages=213–229|year=1974|doi=10.1016/s0022-0000(74)80008-5 |doi-access=free}}.
*{{citation|first1=R.|last1=Impagliazzo|author1-link=Russell Impagliazzo|first2=G.|last2=Tardos|contribution=Decision versus search problems in super-polynomial time|title=[[Symposium on Foundations of Computer Science|Proceedings of IEEE FOCS 1989]]|pages=222–227|year=1989}}.
*{{citation|first=O.|last=Watanabe|title=Comparison of polynomial time completeness notions|journal=Theoretical Computer Science|volume=54|pages=249–265|year=1987|issue=2–3 |doi=10.1016/0304-3975(87)90132-0 |doi-access=free}}.