Allender, E.; Strauss, M., Measure on small complexity classes with applications for BPP, Proceedings of IEEE FOCS'94: 807–818, 1994, Template:ECCC, DIMACS TR 94-18.
Book, R., On languages accepted in polynomial time, SIAM Journal on Computing, 1972, 1 (4): 281–287.
Book, R., Comparing complexity classes, Journal of Computer and System Sciences, 1974, 3 (9): 213–229.
Impagliazzo, R.; Tardos, G., Decision versus search problems in super-polynomial time, Proceedings of IEEE FOCS 1989: 222–227, 1989.
Watanabe, O., Comparison of polynomial time completeness notions, Theoretical Computer Science, 1987, 53: 249–265.
複雜度, 在計算複雜度理論內, 複雜度類e代表一個決定型問題的集合, 裡面的問題可以使用確定型圖靈機在2o, 等於複雜度類dtime, e與相近的類別exptime不同, 在多項式時間多對一歸約時並不封閉, 參考資料, 编辑allender, strauss, measure, small, complexity, classes, with, applications, proceedings, ieee, focs, 1994, template, eccc, dimacs, book, languages, . 在計算複雜度理論內 複雜度類E代表一個決定型問題的集合 裡面的問題可以使用確定型圖靈機在2O n 等於複雜度類DTIME 2O n E與相近的類別EXPTIME不同 在多項式時間多對一歸約時並不封閉 參考資料 编辑Allender E Strauss M Measure on small complexity classes with applications for BPP Proceedings of IEEE FOCS 94 807 818 1994 Template ECCC DIMACS TR 94 18 Book R On languages accepted in polynomial time SIAM Journal on Computing 1972 1 4 281 287 Book R Comparing complexity classes Journal of Computer and System Sciences 1974 3 9 213 229 Impagliazzo R Tardos G Decision versus search problems in super polynomial time Proceedings of IEEE FOCS 1989 222 227 1989 Watanabe O Comparison of polynomial time completeness notions Theoretical Computer Science 1987 53 249 265 外部連結 编辑Complexity Zoo Class E nbsp 这是一篇電腦科學小作品 你可以通过编辑或修订扩充其内容 查论编 取自 https zh wikipedia org w index php title E 複雜度 amp oldid 58514629, 维基百科，wiki，书籍，书籍，图书馆，
