Complexity of some graph-based bounds on the probability of a union of events (Q1752603)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of some graph-based bounds on the probability of a union of events |
scientific article; zbMATH DE number 6872588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of some graph-based bounds on the probability of a union of events |
scientific article; zbMATH DE number 6872588 |
Statements
Complexity of some graph-based bounds on the probability of a union of events (English)
0 references
24 May 2018
0 references
Bonferroni bounds
0 references
2-trees
0 references
chordal graphs
0 references
cherry trees
0 references
coherent probability
0 references
0 references
0 references
0 references
0.8768523931503296
0 references
0.8532412052154541
0 references
0.847855269908905
0 references
0.8461836576461792
0 references
0.8430432081222534
0 references
