翻訳と辞書 Words near each other ・ Nth root algorithm ・ Nthabiseng Mokoena ・ Nthato Motlana ・ Nthellworld ・ NTHL1 ・ NTHS ・ NTHU College of Electrical Engineering and Computer Science ・ NthWORD ・ Nti ・ NTI (disambiguation) ・ NTi Audio ・ NTIA Manual of Regulations and Procedures for Federal Radio Frequency Management ・ Ntiero Effiom ・ Ntim Gyakari ・ Ntimbale Dam ・ NTIME ・ Ntinda ・ Ntinos Konstantakis ・ Ntjam Rosie ・ Ntjanini ・ NTK ・ NTL ・ NTL Incorporated ・ NTL Ireland ・ NTL Player of the Series ・ NTLA ・ NTLDR ・ Ntlhell ・ Ntlhoi Motsamai ・ NTLMSSP Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク NTIME ： ウィキペディア英語版 NTIME In computational complexity theory, the complexity class NTIME(''f''(''n'')) is the set of decision problems that can be solved by a non-deterministic Turing machine which runs in time ''O''(''f''(''n'')). Here ''O'' is the big O notation, ''f'' is some function, and ''n'' is the size of the input (for which the problem is to be decided). ==Meaning== This means that there is a non-deterministic machine which, for a given input of size ''n'', will run in time ''O''(''f''(''n'')) (i.e. within a constant multiple of ''f''(''n''), for ''n'' greater than some value), and will always "reject" the input if the answer to the decision problem is "no" for that input, while if the answer is "yes" the machine will "accept" that input for at least one computation path. Equivalently, there is a deterministic Turing machine ''M'' that runs in time ''O''(''f''(''n'')) and is able to check a polynomial-length certificate for an input; if the input is a "yes" instance, then at least one certificate is accepted, if the input is a "no" instance, no certificate can make the machine accept. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「NTIME」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.