A fundamental step in any cutting plane algorithm is separation: deciding whether a violated inequality exists within a certain class of inequalities. It is customary to express the complexity of a separation algorithm in n, the number of variables. Here, we argue that the input to a separation...