, Volume 10, Issue 4, pp 349–365

Approximate Inclusion-Exclusion

  • Nathan Linial
  • Noam Nisan


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 allk-wise intersections are given for everyk≤K. It turns out that the answer changes in a significant way aroundK=√n: ifK≤O(√n) then any approximation may err by a factor of θ(n/K2), while ifK≥ Ω(√n) it is shown how to approximate the size of the union to within a multiplicative factor of\(1 \pm e^{ - \Omega (K/\sqrt n )} \).

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.

AMS subject classification (1980)

05 A 20 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N.Alon, and J.Hastad: Private communication. 1988.Google Scholar
  2. [2]
    M.Ajtai, and A.Wigderson: Deterministic simulation of probabilistic constant depth circuits, In 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, (1985), 11–19.Google Scholar
  3. [3]
    C. E.Bonferroni: Teoria statistica delle classi e calcolo dell probabilita, Involume in onore di Ricardo Dalla Volta, Universita di Firenze, (1937), 1–62.Google Scholar
  4. [4]
    E. W.Cheney.:Approximation Theory, McGraw-Hill Book Co.,1966.Google Scholar
  5. [5]
    S. M. Kwerel: Most stringent bounds on aggregated probabilities of partially specified dependent probability systems,J. Am. Stat. Assoc. 70, (1975), 472–479.Google Scholar
  6. [6]
    N.Nisan, and A.Wigderson: Hardness vs. randomness. In 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, October (1988), 2–12.Google Scholar
  7. [7]
    A. Prékopa: Boole-Bonferroni inequalities and linear programming,Operation Research 36, (1988), 145–162.Google Scholar
  8. [8]
    Theodore J.Rivlin:An Introduction to the Approximation of Functions, Blaisdell Publishing Company,1969.Google Scholar
  9. [9]
    H, J.Ryser:Combinatorial mathematics, The Mathematical Association of America,1963.Google Scholar
  10. [10]
    L.G. Valiant: The complexity of computing the permanent,Theor. Comp. Sci.,8, (1979), 189–201.CrossRefGoogle Scholar

Copyright information

© Akadémiai Kiadó 1990

Authors and Affiliations

  • Nathan Linial
    • 1
    • 2
  • Noam Nisan
    • 3
  1. 1.IBM-AlmadenStanford UniversityUSA
  2. 2.Hebrew UniversityUSA
  3. 3.Laboratory for Computer scienceMITCambridgeUSA

Personalised recommendations