dc.contributor.author Bilardi, Gianfranco en_US dc.contributor.author Moitra, Abha en_US dc.date.accessioned 2007-04-23T17:36:48Z dc.date.available 2007-04-23T17:36:48Z dc.date.issued 1989-05 en_US dc.identifier.citation http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1012 en_US dc.identifier.uri https://hdl.handle.net/1813/6812 dc.description.abstract 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 implicant. It is also shown that the bound is existentially tight by constructing a family of monotone functions that can be computed in $T = O$(log $l$ + (log $n$)/$l$), even by an EREW-PRAM. The same results hold if $l$ is replaced by $L$, the size of the largest prime clause. An intermediate result of independent interest is that $S (n,l)$, the size of the largest minimal vertex cover minimized over all (reduced) hypergraphs of $n$ vertices and maximum hyperedge size $l$, satisfies the bounds $\Omega(n^{1/l}) \leq S (n,l) \leq O (ln^{1/l}).$ en_US dc.format.extent 1526133 bytes dc.format.extent 365847 bytes dc.format.mimetype application/pdf dc.format.mimetype application/postscript dc.language.iso en_US en_US dc.publisher Cornell University en_US dc.subject computer science en_US dc.subject technical report en_US dc.title Time Lower Bounds for CREW-PRAM Computation of Monotone Functions en_US dc.type technical report en_US
﻿