Data structures and efficient algorithms pp 309-329
Complexity of Boolean functions on PRAMs - Lower bound techniques
- First Online:
- Cite this paper as:
- Kutyłowski M. (1992) Complexity of Boolean functions on PRAMs - Lower bound techniques. In: Monien B., Ottmann T. (eds) Data structures and efficient algorithms. Lecture Notes in Computer Science, vol 594. Springer, Berlin, Heidelberg
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a substantial progress has been made in this area. In this survey paper, we discuss the results that have been obtained for three types of parallel random access machines (PRAMs): CREW, ROBUST and EREW.
Unable to display preview. Download preview PDF.