Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids
cs.DS, cs.IT, math.CO, math.IT, math.PR
Submitted: 2018-07-02
Updated: 2018-11-05
Terminology
Sources
- Hodge Theory for Combinatorial Geometries
- Bounds on the permanent and some applications
- Counting Matchings via Capacity Preserving Operators
Related papers
- 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
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles