On the complexity of computing the measure of ∪[ai,bi]
The decision tree complexity of computing the measure of the union of n (possibly overlapping) intervals is shown to be &OHgr;(n log n), even if comparisons between…
On the complexity of computing the measure of ∪[ai,bi]
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved