About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
The Inclusion-Exclusion formula expresses the size of a union of a family of sets in terms of the sizes of intersections of all subfamilies. This paper considers approximating the size of the union when intersection sizes are known for only some of the subfamilies, or when these quantities are given to within some error, or both. In particular, we consider the case when all k-wise intersections are given for every k≤K. It turns out that the answer changes in a significant way around K=√n: if K≤O(√n) then any approximation may err by a factor of θ(n/K2), while if K≥ Ω(√n) it is shown how to approximate the size of the union to within a multiplicative factor of {Mathematical expression}. When the sizes of all intersections are only given approximately, good bounds are derived on how well the size of the union may be approximated. Several applications for Boolean function are mentioned in conclusion. © 1990 Akadémiai Kiadó.