A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper gives a full characterization of the time needed to compute a boolean function on a CREW PRAM with an unlimited number of processors. The characterization is given in terms of a new complexity measure of boolean functions: the "block sensitivity". This measure is a generalization of the well know "critical sensitivity" measure (see [wl, [CDR], [Si]). The block sensitivity is also shown to relate to the boolean decision tree complexity, and the implication is that the decision treedoi:10.1145/73007.73038 dblp:conf/stoc/Nisan89 fatcat:uzzmpa3ldbcdvl4mcj4l75z34q