 It turns out that there is a natural connection between circuit size complexity and time complexity.Intuitively, a language with small time complexity (that is, requires relatively few sequential operations on a Turing machine), also has a small circuit complexity (that is, requires relatively few Boolean operations).Formally, it can be shown that if a language is in formula_11, where formula_12 is a function formula_13, then it has circuit complexity formula_14.