In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits C 1 , C 2 , … {\displaystyle C_{1},C_{2},\ldots } (see below).
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits C 1 , C 2 , … {\displaystyle C_{1},C_{2},\ldots } (see below).
Source: Wikipedia "Circuit complexity" · CC BY-SA 4.0
Share this article: X · Bluesky