The following pages link to (Q3138745):
Displaying 13 items.
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Counting linear extensions (Q1183942) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space (Q2187655) (← links)
- How to integrate a polynomial over a simplex (Q3081285) (← links)
- Polytope Volume Computation (Q3361496) (← links)
- Performance metric and analytical gain optimality for set-based robust fault detection (Q6537335) (← links)
- Optimal oversampling ratio in two-step simulation (Q6614296) (← links)
- The best ways to slice a polytope (Q6657200) (← links)
