https://wiki.taigi.ima.org.tw/w/index.php?action=history&feed=atom&title=E%28%E8%A4%87%E9%9B%9C%E5%BA%A6%29 2026-04-04T06:43:18Z 本 wiki 上此頁面的修訂紀錄 MediaWiki 1.43.1 https://wiki.taigi.ima.org.tw/w/index.php?title=E(%E8%A4%87%E9%9B%9C%E5%BA%A6)&diff=391576&oldid=prev 2025-08-22T07:33:45Z

<p>從 JSON 檔案批量匯入</p> <p><b>新頁面</b></p><div>佇咧算複雜度理論內，複雜度類&#039;&#039;&#039;E&#039;&#039;&#039;代表一个決定型問題的集合，內底的問題會當使用確定型圖靈機佇兩 O ( n )，等於複雜度類 DTIME ( 二 O ( n ) )。<br /> <br /> &#039;&#039;&#039;E&#039;&#039;&#039;佮相倚的類別 EXPTIME 無仝，佇咧多項式時間濟著歸約的時陣並無封閉。<br /> <br /> ==參考資料==<br /> <br /> * Allender , E . ; Strauss , M . , Measure on small complexity classes with applications for BPP , Proceedings of IEEE FOCS&#039;九十四 : 八百空七–八百十八 , 一千九百九十四 , Template : ECCC , DIMACS TR 九十四孵十八   .<br /> * Book , R . , On languages accepted in polynomial time , SIAM Journal on Computing , 一千九百七十二 ,&#039;&#039;&#039;一&#039;&#039;&#039;( 四 ) : 兩百八十一–兩百八十七   .<br /> * Book , R . , Comparing complexity classes , Journal of Computer and System Sciences , 一千九百七十四 ,&#039;&#039;&#039;三&#039;&#039;&#039;( 九 ) : 兩百十三–兩百二十九   .<br /> * Impagliazzo , R . ; Tardos , G . , Decision versus search problems in super-polynomial time , Proceedings of IEEE FOCS 一千九百八十九 : 兩百二十二–兩百二十七喔 , 一千九百八十九   .<br /> * Watanabe , O . , Comparison of polynomial time completeness notions , Theoretical Computer Science , 一千九百八十七 ,&#039;&#039;&#039;五十三&#039;&#039;&#039;: 兩百四十九–兩百六十五   .<br /> <br /> ==外部連結==<br /> <br /> * _ Complexity Zoo _ : Class E<br /> <br /> [[分類: 待校正]]</div>

TaiwanTonguesApiRobot