CREW PRAMs and Decision Trees

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.

Authors

• Noam Nisan

Keywords

No keywords are indexed for this paper.