Pages that link to "Item:Q2373724"
From MaRDI portal
The following pages link to Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724):
Displaying 4 items.
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Lower bounds for three algorithms for transversal hypergraph generation (Q1028117) (← links)
- Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points (Q1728220) (← links)
