Pages that link to "Item:Q1028488"
From MaRDI portal
The following pages link to Upper bounds of degree 3 for the probability of the union of events via linear programming (Q1028488):
Displaying 9 items.
- Graph-based upper bounds for the probability of the union of events (Q1010734) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs (Q1765524) (← links)
- Computing bounds for the probability of the union of events by different methods (Q1945070) (← links)
- The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
- Inequalities for discrete higher order convex functions (Q3405648) (← links)
- New upper bounds on the probability of events based on graph structures (Q3422483) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
