Everything about AC0
Complexity class of bounded-depth circuits
AC0 (alternating circuit) is a complexity class used in circuit complexity. It is the smallest class in the AC hierarchy, and consists of all families of circuits of depth O(1) and polynomial size, with unlimited-fanin AND gates and OR gates (we allow NOT gates only at the inputs). It thus contains NC0, which has only bounded-fanin AND and OR gates. Such circuits are called "alternating circuits", since it is only necessary for the layers to alternate between all-AND and all-OR, since one AND after another AND is equivalent to a single AND, and the same for OR. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: AC0A 5-minute orientation
- Pick up a classic book: Student Manual : Adobe Acrobat 7. 0 ProfessionalThe most-reprinted book on the subject
- Read the landmark paper: Probabilistic polynomials, AC0 functions and the polynomial-time hierarchyCited 40 times
- Go sideways: TC0A closely related topic
- Go sideways: Circuit complexityA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy
Fusion trees can be implemented with AC0 instructions only
AC0 EIGHT-NODE MEMBRANE-SHEAR-BENDING ELEMENT FOR GEOMETRICALLY NON-LINEAR (STATIC AND DYNAMIC) ANALYSIS OF LAMINATES
On TC0, AC0, and Arithmetic Circuits
k-Subgraph Isomorphism on AC0 Circuits
Optimal Depth, Very Small Size Circuits for Symmetrical Functions in AC0
AC0∘MOD2 lower bounds for the Boolean Inner Product
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
📚 Books worth reading
- 📕Student Manual : Adobe Acrobat 7. 0 ProfessionalAxzo Press Staff · 2006
- 📕Student Manual and Data : Acrobat 7. 0 ProfessionalLogical Logical Operations · 2006
- 📕AC voltage calibrations for the 0.1 Hz to 10 Hz frequency rangeHoward K Schoenwetter · 1983
ACE ProjectInternational Institute for Democracy and Electoral Assistance · 2000- 📕Acp Financial Accounting Iii : ac0ct 1110 Working Papers · 2015
Medical School 2.0David Larson MD · 2015- 📕Adobe Experience Manager Forms Developer 9A0-410 ACE ExamOaz Institute · 2020
- 📕ACE user guidePCI Geomatics. · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- TC0 In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in…
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…
- TC (complexity) In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC (Threshold Circuit) is a complexity class…
- ACC0 ACC0, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The…
- NC (complexity) Unsolved problem in computer science 𝖭𝖢=?𝖯 More unsolved problems in computer science In computational complexity theory, the class NC (for Nick's…
- DLOGTIME In computational complexity theory, DLOGTIME is the complexity class of all computational problems solvable in a logarithmic amount of computation time…
- Parity function In Boolean algebra, a parity function is a Boolean function whose value is one if and only if the input vector has an odd number of ones. The parity function…
- AC (complexity) In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth O ( log…