Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs

  title={Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs},
  author={Martin Dietzfelbinger and Miroslaw Kutylowski and R{\"u}diger Reischuk},
  journal={J. Comput. Syst. Sci.},
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random access machines (CREW PRAMs) is considered. We improve results of Cook, Dwork, and Reischuk (SIAM J. Comput. 15 (1986), 87-97), and extend work of Kutytowski (SIAM J. Comput. 20 (1991), 824-833), who proved a lower time bound for the OR function on such machines that equals the upper bound. We provide a general means for obtaining exact (i.e., correct up to an additive constant) lower bounds… CONTINUE READING
20 Citations
38 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 38 references

REISCHUK, Upper and lower time bounds for parallel random access machines without simultaneous writes

  • S. CooK, C. DWORK, R AZD
  • SIAM J. Comput
  • 1986
Highly Influential
8 Excerpts

RAZBOROV , Lower bounds on the size of bounded depth networks over a complete basis with logical addition

  • A. A.
  • Mat . Zametki
  • 1992

SZEGEDY, On the degree of boolean functions as real polynomials, in "Proceedings

  • M. N. NISAN
  • 24th ACM Sympos. Theory of Computing,
  • 1992
2 Excerpts

REISCHUK, "Realistic Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs,

  • Technical Report 96,
  • 1991

SZEGEDY , On the degree of boolean functions as real polynomials , in " Proceedings , 24 th ACM Sympos

  • Theory of Computing
  • 1991

Similar Papers

Loading similar papers…