On approximate inclusion-exclusion

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Inclusion - Exclusion for Arbitrary Symmetric Functions ∗

Let A 1 , A 2 ,. .. , A n be events in some probability space. The approximate inclusion-exclusion problem, due to Linial and Nisan (1990), is to estimate Pr[A 1 ∪· · ·∪A n ] given Pr[ i∈S A i ] for all |S | k. Kahn et al. (1996) solve this problem optimally for each k. We study the following more general question: given Pr[ i∈S A i ] for all |S | k, estimate Pr the number of events among A 1 ,...

متن کامل

Inclusion-exclusion meets exclusion

When evaluating the inclusion-exclusion expansion N0 −N(1) −N(2) − · · ·+N(1, 2) +N(1, 3) + · · · many of the terms N(· · ·) may turn out to be zero, and hence should be discarded beforehand. Often this can be done.

متن کامل

On Ternary Inclusion - Exclusion Polynomials

Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the coefficients of these polynomials. After establishing some basic properties of inclusion-exclusion polynomials we turn to a detailed study of the structure of ternar...

متن کامل

The Inclusion-Exclusion Principle for IF-States

Applying two definitions of the union of IF-events, P. Grzegorzewski gave two generalizations of the inclusion-exclusion principle for IF-events.In this paper we prove an inclusion-exclusion principle for IF-states based on a method which can also be used to prove Grzegorzewski's inclusion-exclusion principle for probabilities on IF-events.Finally, we give some applications of this principle by...

متن کامل

Quick Inclusion-Exclusion

Many data mining algorithms make use of the well-known Inclusion-Exclusion principle. As a consequence, using this principle efficiently is crucial for the success of all these algorithms. Especially in the context of condensed representations, such as NDI, and in computing interesting measures, a quick inclusion-exclusion algorithm can be crucial for the performance. In this paper, we give an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial

سال: 2008

ISSN: 2640-7345,2640-7337

DOI: 10.2140/iig.2008.6.249