|
TC0 is a complexity class used in circuit complexity. It is the first class in the hierarchy of TC classes. TC0 contains all languages which are decided by Boolean circuits with constant depth and polynomial size, containing only unbounded-fanin AND gates, OR gates, NOT gates, and majority gates. Equivalently, threshold gates can be used instead of majority gates. TC0 contains several important problems, such as sorting ''n'' ''n''-bit numbers, multiplying two ''n''-bit numbers, integer division or recognizing the Dyck language with two types of parentheses. ==Complexity class relations== We can relate TC0 to other circuit classes, including AC0 and NC1; Vollmer 1999 p. 126 states: Vollmer states that the question of whether the last inclusion above is strict is "one of the main open problems in circuit complexity" (ibid.). We also have that uniform . (Allender 1996, as cited in Burtschick 1999). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「TC0」の詳細全文を読む スポンサード リンク
|