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 ) {\displaystyle O(\log ^{i}n)} and a polynomial number of unlimited fan-in AND and OR gates.
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 ) {\displaystyle O(\log ^{i}n)} and a polynomial number of unlimited fan-in AND and OR gates.
Source: Wikipedia "AC (complexity)" · CC BY-SA 4.0
Share this article: X · Bluesky