Inclusion-exclusion: exact and approximate (Q1375692)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1102603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inclusion-exclusion: exact and approximate |
scientific article; zbMATH DE number 1102603 |
Statements
Inclusion-exclusion: exact and approximate (English)
0 references
11 January 1998
0 references
Given \(n\) events if the probabilities of all \(\leq k\)-wise intersections are given the probability of the union can be calculated within an error \(\exp \bigl( - \Omega(k^2/n)\bigr)\). This is optimal. Given a Boolean formula \(F\) in DNF with \(m\) clauses, if it is known how many assignments satisfy any choice of at most \(\log n +1\) clauses, the number of assignments satisfying \(F\) can be calculated. The results are applied to the edge reconstruction problem, computing permanents, chromatic polynomials, and problems on VC dimensions.
0 references
inclusion-exclusion formula
0 references
0.8740522265434265
0 references
0.8366395235061646
0 references
0.8128333687782288
0 references
0.8019076585769653
0 references
