Pages that link to "Item:Q3422483"

The following pages link to New upper bounds on the probability of events based on graph structures (Q3422483):

Displaying 9 items.

• Optimality conditions for Hunter's bound (Q998337) (← links)
• 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)
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints (Q2341243) (← links)
• Inequalities for discrete higher order convex functions (Q3405648) (← links)
• Linear programming bounds on the union probability (Q5087556) (← links)
• Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)
• Lower Bounds on the Probability of a Finite Union of Events (Q5741087) (← links)
• Tight Probability Bounds with Pairwise Independence (Q6158360) (← links)