Boolean function

An example of a more complicated function is the majority function (of an odd number of inputs).

Algebraically, as a propositional formula using rudimentary boolean functions:

Circuit complexity attempts to classify Boolean functions with respect to the size or depth of circuits that can compute them.

Direct expressions for the coefficients of the polynomial can be derived by taking an appropriate derivative: