Complexity of Boolean functions on PRAMs - Lower bound techniques

  • Mirosław Kutyłowski
Parallel and Distributed Algorithms

DOI: 10.1007/3-540-55488-2_34

Part of the Lecture Notes in Computer Science book series (LNCS, volume 594)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Mirosław Kutyłowski
    • 1
  1. 1.Fachbereich Mathematik-InformatikUniversität-GH PaderbornPaderbornGermany

Personalised recommendations