|
ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The class is defined by augmenting the class AC0 of constant-depth "alternating circuits" with the ability to count; the acronym ACC stands for "AC with counters".〔, p. 126〕 Specifically, a problem belongs to ACC0 if it can be solved by polynomial-size, constant-depth circuits of unbounded fan-in gates, including gates that count modulo a fixed integer. ACC0 corresponds to computation in any solvable monoid. The class is very well studied in theoretical computer science because of the algebraic connections and because it is one of the largest concrete computational models for which computational impossibility results, so-called circuit lower bounds, can be proved. ==Definitions== Informally, ACC0 models the class of computations realised by Boolean circuits of constant depth and polynomial size, where the circuit gates includes "modular counting gates" that compute the number of true inputs modulo some fixed constant. More formally, a language belongs to AC0() if it can be computed by a family of circuits ''C''1, ''C''2, ..., where ''Cn'' takes ''n'' inputs, the depth of every circuit is constant, the size of ''Cn'' is a polynomial function of ''n'', and the circuit uses the following gates: AND gates and OR gates of unbounded fan-in, computing the conjunction and disjunction of their inputs; NOT gates computing the negation of their single input; and unbounded fan-in MOD-''m'' gates, which compute 1 if the number of input 1s is a multiple of ''m''. A language belongs to ACC0 if it belongs to AC0() for some ''m''. In some texts, ACC''i'' refers to a hierarchy of circuit classes with ACC0 at its lowest level, where the circuits in ACC''i'' have depth O(log''i''''n'') and polynomial size.〔 The class ACC0 can also be defined in terms of computations of nonuniform deterministic finite automata (NUDFA) over monoids. In this framework, the input is interpreted as elements from a fixed monoid, and the input is accepted if the product of the input elements belongs to a given list of monoid elements. The class ACC0 is the family of languages accepted by a NUDFA over some monoid that does not contain an unsolvable group as a subsemigroup.〔, 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「ACC0」の詳細全文を読む スポンサード リンク
|