Jump to content

Boolean circuit

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Creidieki (talk | contribs) at 01:58, 21 September 2006 (+stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A Boolean circuit is a mathematical model of computation used in studying computational complexity theory. Boolean circuits are the main object of study in circuit complexity.

Boolean circuits are defined in terms of the gates they contain.

Several important complexity measures can be defined on Boolean circuits, including circuit depth, circuit size, and number of alternations.

Several important complexity classes are defined in terms of Boolean circuits, including NC and AC.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Boolean_circuit&oldid=76907846"