翻訳と辞書 Words near each other ・ 2-Dimethylaminoethylazide ・ 2-Diphenylmethylpyrrolidine ・ 2-Diphenylphosphinobenzaldehyde ・ 2-enoate reductase ・ 2-Epimerase ・ 2-EPT probability density function ・ 2-Ethoxybenzoic acid ・ 2-Ethoxyethanol ・ 2-Ethyl-1-butanol ・ 2-Ethyl-4,5-dimethylphenol ・ 2-Ethylanthraquinone ・ 2-Ethylhexanoic acid ・ 2-Ethylhexanol ・ 2-Ethylidene-1,5-dimethyl-3,3-diphenylpyrrolidine ・ 2-ethylmalate synthase ・ 2-EXPTIME ・ 2-factor theorem ・ 2-Fluoroamphetamine ・ 2-Fluoroethanol ・ 2-Fluoromethamphetamine ・ 2-Formylbenzoate dehydrogenase ・ 2-Formylpyridine ・ 2-functor ・ 2-Furanone ・ 2-furoate—CoA ligase ・ 2-Furoic acid ・ 2-Furonitrile ・ 2-Furoyl chloride ・ 2-furoyl-CoA dehydrogenase ・ 2-graph Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク 2-EXPTIME ： ウィキペディア英語版 2-EXPTIME In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(22''p''(''n'')) time, where ''p''(''n'') is a polynomial function of ''n''. In terms of DTIME, :$\backslash mbox\; =\; \backslash bigcup\_\; \backslash mbox\; \backslash left(\; 2^\; \backslash right)\; .$ We know :P $\backslash subseteq$ NP $\backslash subseteq$ PSPACE $\backslash subseteq$ EXPTIME $\backslash subseteq$ NEXPTIME $\backslash subseteq$ EXPSPACE $\backslash subseteq$ 2-EXPTIME $\backslash subseteq$ ELEMENTARY. 2-EXPTIME can also be reformulated as the space class AEXPSPACE, the problems that can be solved by an alternating Turing machine in exponential space. This is one way to see that EXPSPACE $\backslash subseteq$ 2-EXPTIME, since an alternating Turing machine is at least as powerful as a deterministic Turing machine.〔Christos Papadimitriou, Computational Complexity (1994), ISBN 978-0-201-53082-7. Section 20.1, corollary 3, page 495.〕 2-EXPTIME is one class in a hierarchy of complexity classes with increasingly higher time bounds. The class 3-EXPTIME is defined similarly to 2-EXPTIME but with a triply exponential time bound $2^$. This can be generalized to higher and higher time bounds. ==2-EXPTIME-complete problems== Generalizations of many fully observable games are EXPTIME-complete. These games can be viewed as particular instance of a class of transition systems defined in terms of a set of state variables and actions/events that change the values of the state variables, together with the question of whether a winning strategy exists. A generalization of this class of fully observable problems to partially observable problems lifts the complexity from EXPTIME-complete to 2-EXPTIME-complete. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「2-EXPTIME」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.