We describe and motivate a proposed new approach to the problem of finding a “complexity formula” which lower-bounds the circuit complexity (over circuits in a given class) of an arbitrary boolean function, given its truth table, and which can be used to prove nontrivial lower bounds on the complexity of specific functions of interest. This requires… (More)