An for Mixed Volumes
cs.DS, cs.CC, cs.CG, math.CO, math.PR
Submitted: 2026-11-01
Updated: 2026-11-01
Terminology
Sources
- Lorentzian polynomials
- An FPRAS for Counting Common Bases of Two Matroids
- Counting Matchings via Capacity Preserving Operators
- Approximation algorithm for mixed volumes of a constant number of convex bodies
- Approximating mixed volumes to arbitrary accuracy
- Real Stable Polynomials and Matroids: Optimization and Counting
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time