翻訳と辞書 Words near each other ・ Counting Crows discography ・ Counting Days (film) ・ Counting Down ・ Counting Down the Days ・ Counting Down the Days (song) ・ Counting efficiency ・ Counting Hallways to the Left ・ Counting Heads ・ Counting house ・ Counting measure ・ Counting method ・ Counting of the Omer ・ Counting Other Peoples Money ・ Counting points on elliptic curves ・ Counting problem ・ Counting problem (complexity) ・ Counting process ・ Counting quantification ・ Counting Rod Numerals ・ Counting rods ・ Counting sheep ・ Counting Sheep (album) ・ Counting Sheep (disambiguation) ・ Counting Sheep (Safia song) ・ Counting single transferable votes ・ Counting sort ・ Counting Stars ・ Counting Stars (album) ・ Counting Stars (disambiguation) ・ Counting the Beat Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Counting problem (complexity) ： ウィキペディア英語版 Counting problem (complexity) In computational complexity theory and computability theory, a counting problem is a type of computational problem. If ''R'' is a search problem then :$c\_R(x)=\backslash vert\backslash \backslash vert\; \backslash ,$ is the corresponding counting function and :$\backslash \#R=\backslash$ denotes the corresponding counting problem. Note that ''cR'' is a search problem while #''R'' is a decision problem, however ''cR'' can be ''C'' Cook reduced to #''R'' (for appropriate ''C'') using a binary search (the reason #''R'' is defined the way it is, rather than being the graph of ''cR'', is to make this binary search possible). ==Counting complexity class== If ''NC'' is a complexity class associated with non-deterministic machines then ''#C'' = is the set of counting problems associated with each search problem in ''NC''. In particular, #P is the class of counting problems associated with NP search problems. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Counting problem (complexity)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.