 Several important complexity classes are defined in terms of Boolean circuits.The most general of these is P/poly, the set of languages that are decidable by polynomial-size circuit families.It follows directly from the fact that languages in formula_11 have circuit complexity formula_14 that Pformula_17P/poly.