Showing papers by "Harold Abelson published in 1982"

TL;DR: This work defines two measures, γ and c, of complexity for Boolean functions, which have a more combinatorial flavor and it is easy to show that both of them are close to 0 for literally all “meaningful” Boolean functions of many variables.