Concept

Circuit complexity

The fewest and, or and not operations needed to compute a truth function, when a result may be used as often as it is needed. Almost every function needs exponentially many, yet no function anyone can name is proved to need more than a few times its number of letters.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

Lower boundParityBoolean circuitBoolean formulaCauchy schwarzCounting argumentExhaustive searchHypercubeMajorityTruth function

All concepts