Pages that link to "Item:Q1016541"
From MaRDI portal
The following pages link to A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor (Q1016541):
Displaying 10 items.
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary (Q1611062) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Modified log-Sobolev inequalities for strongly log-concave distributions (Q2227722) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- Heat flow and a faster algorithm to compute the surface area of a convex body (Q2868081) (← links)
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (Q3191970) (← links)
- On The Complexity of Computing Mixed Volumes (Q4388877) (← links)
- Gauges, loops, and polynomials for partition functions of graphical models (Q5857453) (← links)
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid (Q6181233) (← links)
