Pages that link to "Item:Q5170985"
From MaRDI portal
The following pages link to Near-optimal deterministic algorithms for volume computation via M-ellipsoids (Q5170985):
Displaying 7 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)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Stokes, Gibbs, and volume computation of semi-algebraic sets (Q2679606) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Quantitative geometry (Q5170979) (← links)
