Information | |
---|---|
has gloss | eng: In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth O(\log^i n) and a polynomial number of unlimited-fanin AND and OR gates. |
lexicalization | eng: AC |
instance of | e/Complexity class |
Lexvo © 2008-2024 Gerard de Melo. Contact Legal Information / Imprint