AC0
Description: AC0 is a class of Boolean circuits with constant depth, unbounded fan-in gates, and polynomial size, studied in computational complexity theory.
Primary topic: Complexity and Algorithms in Graphs (35%)
Wikidata ID: wiki/Q287954
OpenAlex ID: keywords/ac0
