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. Reischuk},
  journal={J. Comput. Syst. Sci.},
  • Martin Dietzfelbinger, Miroslaw Kutylowski, R. Reischuk
  • Published 1994
  • Mathematics, Computer Science
  • 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 Kutylowski (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
    Shuffles and Circuits: (On Lower Bounds for Modern Parallel Computation)
    • 29
    • PDF
    Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
    • 25
    On the power of Las Vegas II: Two-way finite automata
    • 27
    Lower Bounds for Randomized Exclusive Write PRAMs
    • 11
    • PDF


    Publications referenced by this paper.
    The complexity of Boolean functions
    • 1,070
    • PDF
    Algebraic methods in the theory of lower bounds for Boolean circuit complexity
    • 799
    • PDF
    Constant depth circuits, Fourier transform, and learnability
    • 443
    • PDF
    Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
    • 338
    On the degree of Boolean functions as real polynomials
    • 384
    The influence of variables on Boolean functions
    • 620
    Harmonic Analysis of Polynomial Threshold Functions
    • 205
    • PDF
    On Recognizing Graph Properties from Adjacency Matrices
    • 183
    Generic oracles and oracle classes
    • 158
    • PDF