Now showing items 12-12 of 12

    • Time Lower Bounds for CREW-PRAM Computation of Monotone Functions 

      Bilardi, Gianfranco; Moitra, Abha (Cornell University, 1989-05)
      It is shown that the time to compute a monotone boolean function depending upon $n$ variables on a CREW-PRAM satisfies the lower bound $T = \Omega$(log $l$ + (log $n$)/$l$), where $l$ is the size of the largest prime ...