Real stable polynomials and matroids: optimization and counting

DOI10.1145/3055399.3055457zbMath1370.90180arXiv1611.04548OpenAlexW2563037975MaRDI QIDQ4977986

Damian Straszak, Nisheeth K. Vishnoi

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.04548

zbMATH Keywords

entropyconvex optimizationmatroidsapproximation algorithmsreal stable polynomials

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (17)

Counting matchings via capacity-preserving operators ⋮ Paving property for real stable polynomials and strongly Rayleigh processes ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ On the Complexity of Constrained Determinantal Point Processes ⋮ Combinatorics and preservation of conically stable polynomials ⋮ Imaginary projections: complex versus real coefficients ⋮ Combinatorial Bernoulli factories ⋮ Unnamed Item ⋮ The Ising partition function: zeros and deterministic approximation ⋮ Conic stability of polynomials and positive maps ⋮ Fisher zeros and correlation decay in the Ising model ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Convergence of the non-uniform physarum dynamics ⋮ Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids ⋮ Fisher Zeros and Correlation Decay in the Ising Model ⋮ Conic stability of polynomials ⋮ Dynamic Sampling from Graphical Models

This page was built for publication: Real stable polynomials and matroids: optimization and counting