Computing the optimal probability interval for the union of events is NP-hard.
Hunter, An upper bound for the probability of a union,Journal of Applied Probability13 (1976), 597–603
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.