共 30 条
- [1] Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid [J]. PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 1 - 12
- [2] Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids [J]. 2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 35 - 46
- [3] Anari Nima, 2016, C LEARN THEOR, V49, P103
- [4] [Anonymous], 1993, Matroid Theory
- [5] [Anonymous], 2003, LEC MATH
- [6] [Anonymous], 2016, Concentration Inequalities: A Nonasymptotic Theory of Independence, DOI DOI 10.1093/ACPROF:OSO/9780199535255.001.0001
- [10] Borcea J, 2009, J AM MATH SOC, V22, P521