EXPTIME
EXPTIMEïŒEXPãšãïŒã¯ãèšç®éçè«ã«ãããŠããã¥ãŒãªã³ã°æ©æ¢°ã§ O(2p(n)) ã®æéã§è§£ããå šãŠã®æ±ºå®åé¡ã®éåã§ããããªããp(n) 㯠n ã®å€é åŒé¢æ°ã§ããã
DTIMEã§ã¯æ¬¡ã®ããã«è¡šãããã
以äžã®é¢ä¿ãç¥ãããŠããã
ãŸããæééå±€å®çãšé åéå±€å®çã«ãããæ¬¡ã®ããã«ãªãã
- P EXPTIME  ã〠NP NEXPTIME  ã〠 PSPACE EXPSPACE
åŸã£ãŠãå å«é¢ä¿ã®æåã®3ã€ã®ãã¡å°ãªããšã1ã€ãçéšåéåã®é¢ä¿ã§ãããåŸå3ã€ã®ãã¡å°ãªããšã1ã€ãçéšåéåã®é¢ä¿ã«ããããã ããã©ãããããªã®ãã¯åãã£ãŠããªããå€ãã®ç ç©¶è ã¯äžèšã®å šãŠãçéšåéåã®é¢ä¿ã§ãããšèããŠããããŸããP = NP ã§ããã° EXPTIME = NEXPTIME ãšãªãããšãåãã£ãŠãããNEXPTIME ã¯éæ±ºå®æ§ãã¥ãŒãªã³ã°æ©æ¢°ã§ææ°é¢æ°æéã§è§£ããåé¡ã®ã¯ã©ã¹ã§ãã[1]ã
EXPTIME ã¯ç©ºéïŒé åïŒã®ã¯ã©ã¹ APSPACE ã«ãçãããAPSPACE ã¯äº€æ¿æ§ãã¥ãŒãªã³ã°æ©æ¢°ã§å€é åŒé åã§è§£ããåé¡ã®ã¯ã©ã¹ã§ãããäº€æ¿æ§ãã¥ãŒãªã³ã°æ©æ¢°ã¯æ±ºå®æ§ãã¥ãŒãªã³ã°æ©æ¢°ãšå°ãªããšãåçšåºŠã«åŒ·åã§ããã®ã§ãããã«ãã£ãŠã PSPACE EXPTIME ã瀺ããã[2]ã
EXPTIME ã¯æéèšç®éã«é¢ããéå±€ã®äžéšãšãªã£ãŠããã2-EXPTIME ã¯ã©ã¹ã¯ EXPTIME ãšäŒŒãŠããããäºéææ°æé ãããåé¡ã®ã¯ã©ã¹ã§ããããããäžè¬åããŠããã°æ§ã ãªæéèšç®éã®ã¯ã©ã¹ãå®çŸ©ãããã
EXPTIME-å®å š
[ç·šé]ãã EXPTIME ã®æ±ºå®åé¡ã EXPTIMEå®å šã§ãããšããEXPTIME ã®ããããåé¡ããã®åé¡ã«å€é åŒæéå€å¯Ÿäžéå ã§ãããèšãæããã°ãããåé¡ã®å ·äœäŸãå¥ã®åé¡ã®å ·äœäŸã«å€é åŒæéã§å€æããã¢ã«ãŽãªãºã ãããããã®è§£ãå€ãããªããEXPTIMEå®å šã®åé¡ã¯ EXPTIME ã®åé¡ã®äžã§æãé£ãããšèãããããNP ãš P ãäžèŽãããã©ããã¯åãããªãããEXPTIMEå®å šãªåé¡ã P ã«å±ããªãããšã¯åãã£ãŠãããããã¯ãEXPTIMEå®å šãªåé¡ãå€é åŒæéã§è§£ããªãããšã瀺ãããšã§èšŒæãããã
èšç®å¯èœæ§çè«ã«ãããŠãåºæ¬çãªå€å®äžèœåé¡ã¯æ±ºå®æ§ãã¥ãŒãªã³ã°æ©æ¢°(DTM)ãããå ¥åãåçãããã©ããã®æ±ºå®åé¡ã§ãããæãåºæ¬çãªEXPTIMEå®å šåé¡ã¯ãããåçŽåãããã®ã§ãããDTMãããå ¥åãæå€§ k ã¹ããã以å ã«åçãããã©ããã®å€å®åé¡ã§ããããã®åé¡ã¯èªæãªã·ãã¥ã¬ãŒã·ã§ã³ã O(k) æéããããå ¥å k ã O(log k) ãããã§ç¬Šå·åãããããšãã EXPTIME ãšãªã[3]ããŸãããªã EXPTIMEå®å šã§ãããšèšãããã ãã倧ãŸãã«èšã£ãŠãããã䜿ã£ãŠããæ©æ¢°ãEXPTIMEåé¡ãææ°ã¹ãããã§åçãããã©ãããå€å®ã§ããããã§ãããEXPTIME以äžã®æéã¯èŠããªãã
ä»ã®EXPTIMEå®å šåé¡ãšããŠã¯ãäžè¬åããããã§ã¹[4]ããã§ãã«ãŒ[5]ãå²ç¢ïŒæ¥æ¬ã«ãŒã«ïŒ[6]ã§ã®åœ¢å¢ã倿ããåé¡ãããïŒäžè¬åãããã²ãŒã ãšã¯ãç€ã®ãµã€ãºãšé§æ°ããã©ã¡ãŒã¿åãããã®ïŒããããã®ã²ãŒã ã¯ç€ã®å€§ããã«å¯ŸããŠææ°åæ°ã®ææ°ã§çµããããšããEXPTIMEå®å šãšãªããå²ç¢ã®å Žåãæ¥æ¬ã«ãŒã«ã¯æ±ãã«ããããEXPTIMEå®å šãšãªãããã¢ã¡ãªã«ã«ãŒã«ãäžåœã«ãŒã«ã¯ãããããæ±ãããããããEXPTIMEå®å šãšãªããã©ããã¯äžæã§ããã
äžæ¹ãäžè¬åãããã²ãŒã ã§ããç€ã®å€§ããã«å¯ŸããŠå€é åŒåæ°ã®ææ°ã§çµããã²ãŒã ã¯PSPACEå®å šã§ããããšãå€ããææ°åæ°ã®ææ°ãããã£ãŠããèªåçã«éå埩ãšãªãã²ãŒã ã¯åæ§ã§ããã
ãã®ä»ã®éèŠãªEXPTIMEå®å šåé¡ãšããŠãsuccinct circuitïŒç°¡æœåè·¯ïŒã«é¢ããåé¡ããããsuccinct circuit ãšã¯ãææ°é¢æ°çã«å°ãªã空éã§ã°ã©ãåé¡ãè§£ãã®ã«äœ¿ãããåçŽãªæ©æ¢°ã§ãããå ¥åããŒãæ°ãšåºåããŒãæ°ãå ¥åãšãããããã®éã«ãšããžã匵ãã飿¥è¡åã®ãããªæ®éã®ã°ã©ã衚çŸã§åãåé¡ãè§£ãããšããå Žå㯠På®å šãšãªãããsuccinct circuit ã§ã¯å ¥åã«èŠãããããæ°ãææ°é¢æ°çã«å°ãªããããæéã¯EXPTIMEå®å šãšãªãã®ã§ãã[7]ã
åèæç®
[ç·šé]- â Christos Papadimitriou (1994幎). Computational Complexity. Addison-Wesley. ISBN 0-201-53082-1 Section 20.1, page 491.
- â Papadimitriou (1994), section 20.1, corollary 3, page 495.
- â Chris Umans. âCS 21: Lecture 13 notesâ. 2008幎5æ4æ¥é²èЧã Slide 24.
- â Aviezri Fraenkel and D. Lichtenstein (1981幎). âComputing a perfect strategy for nÃn chess requires time exponential in nâ. J. Comb. Th. A (31): 199â214.
- â J. M. Robson (1984幎). âN by N checkers is Exptime completeâ. SIAM Journal on Computing, 13 (2): 252â267.
- â J. M. Robson (1983幎). âThe complexity of Goâ. Information Processing; Proceedings of IFIP Congress. pp. 413â417
- â Papadimitriou (1994), section 20.1, page 492.