Page, Scott E. - In: Economic Theory 8 (1996) 2, pp. 321-346
The paper constructs two measures of difficulty for functions defined over binary strings. The first of these measures, cover size, captures the difficulty of solving a problem in parallel. The second measure, ascent size, captures the difficulty of solving a problem sequentially. We show how...