Metraipolis › archive › dc_c09e08778bda

AC0 — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/AC0
License (as archived): CC-BY-SA-4.0
Archived: 2026-11-06T23:32:40.833Z
SHA-256 of the archived text: 4cc7b6e25052a4ff8ac9a6d70a7140264f1a06e882f09b4153fb78557a1f44c9
Stable URL of this page: https://metraipolis.com/documento/dc_c09e08778bda

How to cite

AC0 — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/AC0 (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c09e08778bda (Metraipolis archive dc_c09e08778bda, sha256 4cc7b6e25052a4ff8ac9a6d70a7140264f1a06e882f09b4153fb78557a1f44c9)

BibTeX

@misc{dcc09e08778bda,
  title = {AC0 — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/AC0},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c09e08778bda; sha256 4cc7b6e25052a4ff8ac9a6d70a7140264f1a06e882f09b4153fb78557a1f44c9},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/AC0. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «AC0» — https://en.wikipedia.org/wiki/AC0
Wikidata Q287954: «classe di complessità» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q287954
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/AC0?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1358269907, consultata il 2026-11-06T23:29:21.274Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e74202ab0e72f68ee0158808f82ff94bc9712d1694b66d0d098c1c3ff25ef3ba