A key fact in the theory of Boolean functions f: {0, 1}n → {0, 1} is that they often undergo sharp thresholds. For example, if the function f: {0, 1}n → {0, 1} is monotone and symmetric under a ...