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 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)
- Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation (Q808222) (← links)
- The volume algorithm revisited: relation with bundle methods (Q1396813) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← 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)
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (Q3191970) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Quantitative geometry (Q5170979) (← links)
- A quick estimate for the volume of a polyhedron (Q6635461) (← links)