English Wikipedia - The Free Encycl...
Download this dictionary
Circuit complexity
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
Boolean circuits
that compute them. One speaks of the circuit complexity of a Boolean circuit. A related notion is the circuit complexity of a
recursive language
that is
decided
by a family of circuits (see below).
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License