Comparing the sets of volume polynomials and Lorentzian polynomials
From MaRDI portal
Cites work
- A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor
- Combinatorics and Hodge theory
- Computing the volume is difficult
- Convex Bodies The Brunn-MinkowskiTheory
- Correspondences between convex geometry and complex geometry
- Der Wertvorrat der gemischten Inhalte von zwei, drei und vier ebenen Eibereichen.
- Geometric measure theory. A beginner's guide. Illustrated by James F. Bredt
- scientific article; zbMATH DE number 930190 (Why is no real title available?)
- Inequalities between mixed volumes of convex sets
- Inégalités quadratiques entre les volumes mixtes des corps convexes.
- Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids
- Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Lorentzian polynomials
- Lower bounds for contingency tables via Lorentzian polynomials
- On multivariate Newton-like inequalities
- On The Complexity of Computing Mixed Volumes
- Volumen und Oberfläche.
This page was built for publication: Comparing the sets of volume polynomials and Lorentzian polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303676)